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.

CODE:

#include <stdio.h>
#include <string.h>
int main(int argc, char *argv[])  
{  
	int i,j,len,t1;
	bool b;
	char buf[1000001];
	while(scanf("%s",buf)!=EOF&&!(buf[0]=='.'&&strlen(buf)==1))
	{
		len=strlen(buf);
		b=false;
		for(i=1;i<=len/2&&!b;++i)
			if(len%i==0)
			{
				t1=len/i;
				b=true;
				for(j=1;j<t1;j++)
					if (memcmp(buf,buf+j*i,i*sizeof(buf[0])))
					{
						b=false;
						break;
					}	
			}
		if(b)
			printf("%d\n",t1);
		else
			printf("%d\n",1);
	}
	return 0;
}