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.
The single line contains a sequence of characters s1s2...s|s| (1 ≤ |s| ≤ 105) — string s. The string only consists of uppercase English letters.
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 lici. 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.
ABACABA
3 1 4 3 2 7 1
AAA
3 1 3 2 2 3 1
#include <cstdio>
#include <cstring>
int const MAX = 1e5 + 5;
char s[MAX];
int next[MAX];
int len, pos, num;
int l[MAX], cnt[MAX], re[MAX];
void get_next()
{
int i = 0, j = -1;
next[0] = -1;
while(s[i] != '\0')
{
if(j == -1 || s[i] == s[j])
{
i ++;
j ++;
next[i] = j;
}
else
j = next[j];
}
}
void solve()
{
for(int i = 0; i <= len; i++)
re[i] = 1;
for(int i = len; i >= 1; i --)
if(next[i] != -1)
re[next[i]] += re[i];
int pos = len;
while(pos)
{
cnt[num] = re[pos];
l[num ++] = pos;
pos = next[pos];
}
}
int main()
{
scanf("%s", s);
len = strlen(s);
get_next();
solve();
printf("%d\n", num);
for(int i = num - 1; i >= 0; i--)
printf("%d %d\n", l[i], cnt[i]);
}