| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 4 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
|
On
meirbekbolatbekov002 →
How can I optimize Palindrome Reorder problem's solution on CSES.fi?, 3 years ago
0
include<bits/stdc++.h>using namespace std; typedef long long ll; int main() { string str; cin>>str; int n=str.length(); sort(str.begin(),str.end()); string s="";string temp=""; string o="";int c=1,cc=0; for(int i=0;i<n;i++) { if(i==n-1) { if(c%2==0) s.insert((s.length()/2),str.substr(cc,c)); else o+=str.substr(cc,c); } } s.insert((s.length()/2),o); temp=s; reverse(temp.begin(),temp.end()); if(temp==s) cout<<s; else cout<<"NO SOLUTION"<<endl; } |
| Name |
|---|


