G - Next[]树 CodeForces - 432D

You have a string s = s1s2...s|s|, where |s| is the length of string s, and si its i-th character.

Let's introduce several definitions:

    A substring s[i..j] (1 ≤ i ≤ j ≤ |s|) of string s is string sisi + 1...sj.
    The prefix of string s of length l (1 ≤ l ≤ |s|) is string s[1..l].
    The suffix of string s of length l (1 ≤ l ≤ |s|) is string s[|s| - l + 1..|s|].

Your task is, for any prefix of string s which matches a suffix of string s, print the number of times it occurs in string s as a substring.

Input

The single line contains a sequence of characters s1s2...s|s| (1 ≤ |s| ≤ 105) — string s. The string only consists of uppercase English letters.

Output

In the first line, print integer k (0 ≤ k ≤ |s|) — the number of prefixes that match a suffix of string s. Next print k lines, in each line print two integers li ci. Numbers li ci mean that the prefix of the length li matches the suffix of length li and occurs in string s as a substring ci times. Print pairs li ci in the order of increasing li.

Example
Input

ABACABA

Output

3
1 4
3 2
7 1

Input

AAA

Output

3
1 3
2 2
3 1

重点在于怎么求与前缀长为i相同的子串的个数，从后往前递推，因为f[i+1],表示的是以第i个字符结尾的子串与前缀匹配的最大长度，因此，只要f[i + 1]不为0则必定有符合条件的子串，因为每次都会递推到更短的子串去，所以从后往前递推加到各长度的记录中即可，其中，前缀本身也是符合条件的。

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <queue>
#include <cstring>
#include <stack>
using namespace std;
int f[100005],hashs[100005],len;
char str[100005];
stack<int> s;
void getfail(){
    f[0] = f[1] = 0;
    len = strlen(str);
    int j = 0;
    for(int i = 1;i < len;++i){
        while(j && str[i] != str[j]){
            j = f[j];
        }
        f[i + 1] = str[i] == str[j] ? ++j : 0;
    }
    /*for(int i = 0;i <= len;++i){
        cout << f[i] << " ";
    }
    cout << endl;*/
    memset(hashs,0,sizeof(hashs));
    for(int i = len;i >= 1;--i){
        hashs[i]++;
        j = i - 1;
        if(f[j + 1]){
            hashs[f[j + 1]] += hashs[i];
        }
    }
    /*for(int i = 1;i <= len;++i){
        cout << hashs[i] << " ";
    }
    cout << endl;*/
}
int main(){
    while(~scanf("%s",str)){
        getfail();
        int j = len;
        while(j){
            s.push(j);
            j = f[j];
        }
        cout << s.size() << endl;
        while(!s.empty()){
            int t = s.top();
            cout << t << " " << hashs[t] << endl;
            s.pop();
        }
    }
    return 0;
}