[东华oj]22.现代诗如蚯蚓

#include <iostream>
#include<iomanip>
#include<math.h>
using namespace std;

int comchar(char a[],char b[],int n) {
    int flag = 1;
    for (int i = 0; i < n; i++) {
        if (a[i] != b[i])flag = 0;
    }
    return flag;
}

int main() {
    string a;
    while (cin >> a) {
        int length = a.length();
        int cc = 0;
        char* zz = new char[length];
        for (int i = 0; i < length; i++) {
            zz[i] = a[i];
        }
        for (int i = 1; i < length/2+1; i++) {
            if (length % i == 0) {//如果段数能够正好是长度的因数
                char* compare = new char[i];
                char* compare_behind = new char[i];
                for (int j = 0; j < i; j++) {
                    compare[j] = '0';
                    compare_behind[j] = '0';
                }//init
                for (int j = 0; j < i; j++) {
                    compare[j] = a[j];
                }//构造比较字段
                
                int p_length = i;
                int flag = 1;
                int ff_quyu = 0;
                while (p_length+i <= a.length() && flag == 1) {
                    ff_quyu++;
                    for (int j = 0; j < i; j++) {
                        compare_behind[j] = a[j+p_length];
                    }//构造比较字段
                    p_length += i;
                    if (comchar(compare,compare_behind,i) == 0) {
                        //字符串不相同
                        flag = 0;
                        break;
                    }
                }
                if (flag == 1) {
                    cc = 1;
                    cout << a.length() / i << endl;
                    break;
                }
            }
        }
        if (cc == 0)cout << 1 << endl;
    }
    return 0;
}