http://poj.org/problem?id=2406
Power Strings
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.
Source
思路:其实就是求最小周期,再将总长度除以它即可
#include<stdio.h>
#include<string.h>
int main()
{
int i,j,ok,len,n;
char s[1000002];
while(scanf("%s",s)!=EOF&&(s[0]!='.'))
{
len=strlen(s);
for(i=1;i<=len;i++)
if(len%i==0)
{
ok=1;
for(j=i;j<len;j++)
{
if(s[j]!=s[j%i])
{ok=0;break; }
}
if(ok)
break;
}
n=len/i;
printf("%d\n",n);
}
return 0;
}