字符环

#include <iostream>
#include <string>
using namespace std;

int getMaxCycle(string& s1, string& s2)
{
    int max = 0;
    for(int i = 0; i < s1.length() / 2; i++)
    {
        for(int j = 1; j <= s1.length() / 2 + 1; j++)
        {
            if(j <= max)
                continue;
            // cout << s1.substr(i, j) << endl;
            if(s2.find(s1.substr(i, j)) != string::npos && j > max)
            {
                max = j;
                // cout << max << endl;
            }
        }
    }
    return max;
}

int main()
{
    string s1, s2;
    while(cin >> s1 >> s2, s1.length() != 1 && s2.length() != 1)
    {
        s1 += s1.substr(0, s1.size() - 1);
        s2 += s2.substr(0, s2.size() - 1);
        int max = 0;
        if(s1.length() < s2.length())
            max = getMaxCycle(s1, s2);
        else
            max = getMaxCycle(s2, s1);    
        cout << max << endl;
    }
    return 0;
}