Envío 2114

Código

#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <vector>
#include <stack>
#include <algorithm>
#define forn(a, n) for(int a = 0; a<(int) (n); ++a)
#define rforn(a, n) for(int a = (n)-1; a>=0; --a)
using namespace std;
const int N = 6e5+20;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    
    string s;
    cin>>s;

    if(s.size() == 0 || s.size() == 1) { cout<<0<<endl; return 0; }

    int lleva = 0;
    for(int j = 1; j < s.size(); j++)
    {
        if(s[0] == s[j])

        {
            for(int k = 0, l = j; l < s.size(); k++, l++)
            {
                if(k+100 < s.size()-1 && l+100 < s.size() && s[l+100] != s[l+100] && s[l+150] != s[l+150] && s[l+250] != s[l+250] && s[l+373] != s[l+373] && s[l+1087] != s[l+1087] && s[l+5432] != s[l+5432] && s[l+9876] != s[l+9876] && s[l+11111] != s[l+11111] && s[l+12345] != s[l+12345] && s[l+23456] != s[l+23456] && s[l+34567] != s[l+34567] && s[l+67890] != s[l+67890] && s[l+99998] != s[l+99998] && s[l+99999] != s[l+99999]) {lleva = 0; break;}

                if(s[k] != s[l]) {lleva = 0; break;}
                lleva++;
                //cout<<lleva<<endl;
            }
            //cout<<lleva<<endl;
            if(lleva != 0)
            {
                cout<<lleva<<endl;
                return 0;
            }
        }
    }
    //if(lleva==s.size()) lleva++;
    cout<<lleva<<endl;
    return 0;
}