UVA-455

UVA-455

这道题的输出格式要求很特别

//#define _CRT_SECURE_NO_WARNINGS
#include<cstdio>
#include<cstring>
#include<cctype>
char s[1010];
bool isperidic(const char *s, int p)
{
    
    
    char tmp;
    for (int i = 0; i <= p; ++i) {
    
    
        int idx = i; tmp = s[idx];
        while (idx < strlen(s)){
    
    
            if (s[(idx + p) % strlen(s)] != tmp) return false;
            idx += p;
        }
    }
    return true;
}
int main()
{
    
    
    //freopen("input.txt", "r", stdin);
    int T; scanf("%d", &T); int T0 = T;
    while (T--) {
    
    
        if (T+1 != T0) {
    
     printf("\n"); }
        memset(s, '\0', sizeof(s));
        scanf("%s", &s);
        int n = strlen(s); int peridic = 1;
        for (int i = 1; i <= n; ++i) {
    
    
            if (n%i != 0) continue;
            if (isperidic(s, i)) {
    
    
                peridic = i;
                printf("%d\n", peridic);
                break;
            }
        }
    }
    return 0;
}
//首先周期数必定是strlen(s)的因数
//strlen(s)<80,所以可以遍历周期数来进行判断；
//用处理循环数组的方法（取余数）来解决越界的问题