POJ 2406 依然 KMP

找循环串

跟 POJ 1961 一样的

http://blog.csdn.net/u012935901/article/details/20219851

#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <queue>
#include <map>
#include <set>
#include <cmath>

using namespace std;

#define MAX 1100000 
#define INF 0x3f3f3f3f
#define MS(x) memset(x,0,sizeof(x))
#define ll long long
//#define P pair<int,int>
#define fst first
#define sec second
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define MOD 57
int n,m;
int f[MAX];
char P[MAX];
int loop[MAX];
void getFail()
{
	f[0]=f[1]=0;
	for(int i=1;i<n;i++)
	{
		int j=f[i];
		while(j!=0&&P[i]!=P[j])
			j=f[j];
		f[i+1]=P[i]==P[j]?j+1:0;
	}
}

int main()
{
	int T=0;
	while(scanf("%s",&P))
	{
		if(P[0]=='.')
			return 0;
		n=strlen(P);
		getFail();
		int ans=1;
		if(P[f[n-1]]==P[n-1])
		{
			int tl=(n-(f[n-1]+1));
			if(n%tl==0)
				ans=n/tl;
		}
		cout<<ans<<endl;
	}
	return 0;
}