Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- string s;
- int occ[26], n;
- int res;
- int main()
- {
- cin >> s;
- n = s.size();
- for(int i = 0; i < n; i++) {
- occ[s[i]-'A']++;
- }
- for(int l = 0; l < n-3; l++) {
- if(occ[s[l]]%4) continue;
- for(int step = 1; l + step*4 <= n; step++) {
- int r = l + step*4 - 1;
- bool valid = 1;
- for(int i = 0; i < step*2; i++) {
- if(s[l+i] != s[l+step*2+i]) {
- valid = 0;
- break;
- }
- }
- if(valid) {
- // for(int i = l; i <= r; i++) {
- // cout << s[i];
- // }
- // cout << "\n";
- res = max(res, step*4);
- }
- }
- }
- cout << res << endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement