UVa 455 Periodic Strings(字符串处理)

传送门

A character string is said to have period k if it can be formed by concatenating one or more repetitions
of another string of length k. For example, the string ”abcabcabcabc” has period 3, since it is formed
by 4 repetitions of the string ”abc”. It also has periods 6 (two repetitions of ”abcabc”) and 12 (one
repetition of ”abcabcabcabc”).
Write a program to read a character string and determine its smallest period.
Input
The first line oif the input file will contain a single integer N indicating how many test case that your
program will test followed by a blank line. Each test case will contain a single character string of up
to 80 non-blank characters. Two consecutive input will separated by a blank line.
Output
An integer denoting the smallest period of the input string for each input. Two consecutive output are
separated by a blank line.
Sample Input
1
HoHoHo
Sample Output
2

巧用枚举&模运算：
字符串的最短循环长度一定是总长度的约数（能被strlen(str)整除）
用模运算比较是否相同
一旦找到就break
格式是个坑点
给个样例I/O:

4
a
1

acddca
6

acca
4

ac
2
acdacd
3

代码：

#include <stdio.h>
#include <string.h>
using namespace std;
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        while(n--)
        {
            char str[99];
            scanf("%s",str);
            int len = strlen(str);
            for(int i=1,j; i<=len; i++)
            {
                if(len%i==0)
                    for(j=i; j<len; j++)
                        if(str[j]!=str[j%i])
                            break;
                if(j==len)
                {
                    printf("%d\n",i);
                    break;
                }
            }
            if(n)
                puts("");
        }
    }
    return 0;
}