UVA 455 Periodic Strings (最短周期串长度)

 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

原题链接:http://acm.hust.edu.cn/vjudge/problem/viewProblem.action?id=19496

题意:求最小循环节长度.

做法:枚举循环节的长度.

AC代码:

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

char str[104];

int main()
{
    int n;
    cin>>n;
    while (n --)
    {
        cin>>str;
        int len = strlen(str);
        for (int k,i = 1 ; i <= len ; i++)
        {
            if (len%i == 0)
            {
                for (k = i ; k < len ; k++)
                    if (str[k] != str[k%i])
                        break;
                if (k == len)
                {
                    cout<<i<<endl;
                    break;
                }
            }
        }
        if(n)
            cout<<endl;
    }
    return 0;
}