UVa OJ 455 Periodic Strings

UVa OJ 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

寻找周期字符串的最小周期。从小到大枚举各个周期，一旦符合条件就输出。注意每一个测试用例的输出结果之间空一行，最后一个用例的输出后面无空行。

#include <cstdio>
#include <cstdlib>t 
#include <cstring> 

using namespace std;

int main(int argc, char *argv[])
{
    int N = 0;
    char word[100];
    scanf("%d", &N);
    while (N--)
    {
        scanf("%s", word);
        int len = strlen(word);
        for (int i = 1; i <= len; ++i)
        {
            if (len % i == 0)
            {
                int ok = 1;
                for (int j = i; j < len; ++j)
                {
                    if (word[j] != word[j % i])
                    {
                        ok = 0;
                        break;
                    }
                }
                if (ok)
                {
                    printf("%d\n", i);
                    break;
                }
            }
        }
        if (N != 0)
            printf("\n");
    }
    //system("pause");
    return 0;
}