poj 2406 Power Strings

Power Strings

Time Limit: 3000MS		Memory Limit: 65536K
Total Submissions: 17479		Accepted: 7288

Description

Given two strings a and b we define a*b to be their concatenation. For example, if a = "abc" and b = "def" then a*b = "abcdef". If we think of concatenation as multiplication, exponentiation by a non-negative integer is defined in the normal way: a^0 = "" (the empty string) and a^(n+1) = a*(a^n).

Input

Each test case is a line of input representing s, a string of printable characters. The length of s will be at least 1 and will not exceed 1 million characters. A line containing a period follows the last test case.

Output

For each s you should print the largest n such that s = a^n for some string a.

Sample Input

abcd
aaaa
ababab
.

Sample Output

1
4
3

Hint

This problem has huge input, use scanf instead of cin to avoid time limit exceed.

AC代码 :

Memory: 1152K

Time: 235MS

#include

<stdio.h>

#include

<string.h>

int

main

()

{

	char word[1000001];

	int len,i,j;

	while(scanf("%s",word)==1)

	{

		if(word[0]=='.')

			break;

		len=strlen(word);

		for(i=1;i<=len;i++)

			if(len%i==0)

			{

				for(j=i;j<len;j+=i)

					if(strncmp(word,word+j,i))//功能：比较字符串s1和s2的前n个字符。

						break;

				if(j==len)

				{

					printf("%d\n",len/i);

					break;

				}

			}

	}

	return 0;

}

其实也没什么好讲的，水题一道.