poj 1961 2406 让你彻底理解KMP的next[]数组的两个题目

两题运用kmp思路基本上是一样的，都是从头开始找相同前缀的  

运用next数组原理，让你充分理解，即使不理解，你也记住了，哈哈


poj 2406

Power Strings

Time Limit: 3000MS		Memory Limit: 65536K
Total Submissions: 44165		Accepted: 18427

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.

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;

const int MAX_=1000005;
char a[MAX_];
int next[MAX_];
int len;

void getnext()
{
    int i=0;
    int k=-1;
    next[0]=-1;
    while(i<len){
        if(k==-1||a[i]==a[k]){
            i++;k++;
            next[i]=k;
        }
        else
            k=next[k];
    }
}

int main()
{
    while(scanf("%s",a),strcmp(a,"."))
    {
        len=strlen(a);
        getnext();

        if(len%(len-next[len])==0)
            printf("%d\n",len/(len-next[len]));
        else
            printf("1\n");
    }
    return 0;
}

Period

Time Limit: 3000MS		Memory Limit: 30000K
Total Submissions: 16553		Accepted: 7951

Description

For each prefix of a given string S with N characters (each character has an ASCII code between 97 and 126, inclusive), we want to know whether the prefix is a periodic string. That is, for each i (2 <= i <= N) we want to know the largest K > 1 (if there is one) such that the prefix of S with length i can be written as A ^K ,that is A concatenated K times, for some string A. Of course, we also want to know the period K.

Input

The input consists of several test cases. Each test case consists of two lines. The first one contains N (2 <= N <= 1 000 000) – the size of the string S.The second line contains the string S. The input file ends with a line, having the 
number zero on it.

Output

For each test case, output "Test case #" and the consecutive test case number on a single line; then, for each prefix with length i that has a period K > 1, output the prefix size i and the period K separated by a single space; the prefix sizes must be in increasing order. Print a blank line after each test case.

Sample Input

3
aaa
12
aabaabaabaab
0

Sample Output

Test case #1
2 2
3 3

Test case #2
2 2
6 2
9 3
12 4

//poj1961
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;

const int MAX_=1000005;
char a[MAX_];
int next[MAX_];
int len;

void getnext()
{
    int i=0;
    int k=-1;
    next[0]=-1;

    while(i<len){
        if(k==-1||a[i]==a[k]){
            i++;
            k++;
            next[i]=k;
        }
        else
            k=next[k];
    }
}

int main()
{
    int n;
    int count=0;
    while(scanf("%d",&len),len)
    {
        scanf("%s",a);
        printf("Test case #%d\n",++count);

        getnext();

        for(int i=2;i<=len;i++)
        if(i%(i-next[i])==0&&i/(i-next[i])!=1)
            printf("%d %d\n",i,i/(i-next[i]));
        puts("");
    }
    return 0;
}