Periodic Strings (求HoHoHo字符串最小周期)

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

思路主要就看题就行了：

注意：每行答案之间有一个空行。。。

AC代码：

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n;
    cin>>n;
    while(n--)
    {
        char a[85];
        cin>>a;
        int len=strlen(a);
        int i,j;
        for(i=1;i<=len;i++)//i是重复最小的个数，也就是答案，从1开始找
        {
            if(len%i!=0)//竟然不能整除呵呵，所以i不可能是最小周期的啊
                continue;
            else
            {
                for(j=i;j<len;j++)//下标从第0到i-1是第一个周期，那就从下标i开始遍历
                {
                    if(a[j]!=a[j%i])//竟然不一样，那就不成立
                        break;
                }
                if(j==len)//成立！！
                {
                    printf("%d\n",i);//i就是答案
                    break;//找到最小的了就赶紧结束
                }
            }
        }
        if(n!=0)
            printf("\n");//题目要求separated by a line。。。。。真麻烦。。
    }
    return 0;
}