UVa 455 Periodic Strings (字元串處理)

455 - Periodic Strings

Time limit: 3.000 seconds

http://uva.onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=396

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      

WA了？那一定是IO出了問題！

完整代碼：

/*0.028*/

#include <cstdio>
#include <cstring>

char word[100];

int main(void)
{
	int n, len;
	scanf("%d", &n);///注意不要寫"%d\n"因為這樣會忽略多個\n而不是一個
	getchar();
	while (n--)
	{
		getchar();
		gets(word);
		len = strlen(word);
		for (int i = 1; i <= len; i++)
			if (len % i == 0)
			{
				bool ok = true;
				for (int j = i; j < len; j++)
					if (word[j] != word[j % i])
					{
						ok = false;
						break;
					}
				if (ok)
				{
					printf("%d\n", i);
					if (n) putchar('\n');
					break;
				}
			}
	}
	return 0;
}