Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- typedef long long ll;
- int cnt[3];
- string t[3];
- int strt[3];
- int main(){
- string s;
- cin >> s;
- int slen = s.size();
- int tlen = slen / 2;
- for(int i=0; i<3; i++) strt[i] = slen;
- for(char c : s){
- cnt[c-'a']++;
- }
- for(int i=0; i<slen; i++){
- if(strt[s[i]-'a'] == slen) strt[s[i]-'a'] = i;
- }
- for(char c1='a'; c1<='c'; c1++){
- for(char c2='a'; c2<='c'; c2++){
- if(c1 == c2) continue;
- if(strt[c1-'a'] < strt[c2-'a'] and 2*min(cnt[c1-'a'], cnt[c2-'a']) >= tlen){
- for(int i=0; i<min(cnt[c1-'a'], cnt[c2-'a']); i++) cout << c1 << c2;
- return 0;
- }
- }
- }
- cout << "IMPOSSIBLE";
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement