SDUT OJ Period

Period

Time Limit: 1000 ms Memory Limit: 65536 KiB

Submit Statistic

Problem 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 AK ,

that is A concatenated K times, for some string A. Of course, we also want to

know the period K.

 

Input

 The input file 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

Hint

题目的意思是说，给一个n长度的字符串给你，然后让你找出i>=2的前缀同时求出他的周期k

#include<string.h>
#include<stdio.h>
#define N 1000010
char s[N];
int next[N];
void st(char s[])//判断字符串中关系
{
    int i=0;
    int j=-1;
    int len=strlen(s);
    next[0]=-1;
    while(i<=len)
    {
        if(j==-1||s[i]==s[j])
        {
            j++;
            i++;
            next[i]=j;
        }
        else j=next[j];
    }
}
int main()
{
    int n,i;
    int j=0;
    while(scanf("%d",&n)!=EOF)
    {
        if(n==0)break;
        scanf("%s",s);
        st(s);
        j++;
        printf("Test case #%d\n",j);
        for(i=2; i<=n; i++)
        {
            if(i%(i-next[i])==0&&i!=(i-next[i]))
            {
                printf("%d %d\n",i,i/(i-next[i]));//i为前缀，i/(i-next[i])为其周期
            }
        }
        printf("\n");
    }

    return 0;
}