Poj 1961

一个字符串，求这个字符串到第i个字符为止的循环节的次数。
poj2406的加强版
具体思路请参考此处链接
附AC代码

#include<iostream>
using namespace std;
void GetKMPNext(char *Str, int *Next, int nLen)
{
	int i = 0;
	int j = -1;
	Next[i] = j;
	while(i<nLen)
	{
		if (j == -1 || Str[i] == Str[j])
		{
			Next[++i] = ++j;
		}
		else
		{
			j = Next[j];
		}
	}
}
int main()
{
	int Next[1000001];
	char Str[1000001];
	int nLen = 0;
	int nMark = 0;
	while (cin >> nLen)
	{
		if (nLen == 0)
			break;
		cin >> Str;
		GetKMPNext(Str, Next, nLen);
		printf("Test case #%d\n", ++nMark);
		for (int i = 1; i <= nLen; i++)
		{
			if (Next[i] != 0 && i % (i - Next[i]) == 0)
			{
				printf("%d %d\n", i, i / (i - Next[i]));
			}
		}
		printf("\n");
	}
	return 0;
}