C - POJ 2752 Hash

The little cat is so famous, that many couples tramp over hill and dale to Byteland, and asked the little cat to give names to their newly-born babies. They seek the name, and at the same time seek the fame. In order to escape from such boring job, the innovative little cat works out an easy but fantastic algorithm: 

Step1. Connect the father's name and the mother's name, to a new string S. 
Step2. Find a proper prefix-suffix string of S (which is not only the prefix, but also the suffix of S). 

Example: Father='ala', Mother='la', we have S = 'ala'+'la' = 'alala'. Potential prefix-suffix strings of S are {'a', 'ala', 'alala'}. Given the string S, could you help the little cat to write a program to calculate the length of possible prefix-suffix strings of S? (He might thank you by giving your baby a name:) 

Input

The input contains a number of test cases. Each test case occupies a single line that contains the string S described above. 

Restrictions: Only lowercase letters may appear in the input. 1 <= Length of S <= 400000. 

Output

For each test case, output a single line with integer numbers in increasing order, denoting the possible length of the new baby's name.

Sample Input

ababcababababcabab
aaaaa

Sample Output

2 4 9 18
1 2 3 4 5

---

题意：给你一个串，求出既是前缀又是后缀的子串长度。

---

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<queue>
#include<cmath>
#include<stack>
using namespace std;
typedef unsigned long long ull;
ull hash[400010], idx[400010], p = 31, mod = 1000000031;
char mapp[400010];
int main()
{
    idx[0] = 1;
    //用来记录p^i;
    for(int i=1; i<=400000; i++)
    {
        idx[i] = idx[i-1]*p%mod;
    }
    while(scanf("%s", mapp+1)!=EOF)
    {
        int len = strlen(mapp+1);
        for(int i=1; i<=len; i++)
        {
            //求出第i个前缀和的hash值，并存在数组hash[i]中；
            hash[i] = (hash[i-1]*p +mapp[i]-'a')%mod;
        }
        for(int i=1; i<=len; i++)
        {
            //先+mod再%mod 是因为在进行这两个操作之前，得到的hash值有可能会出现负数；
            if(  hash[i]==(  (hash[len]-(hash[len-i]*idx[i]%mod))  +mod)%mod  )
                printf("%d ", i);
        }
        printf("\n");
    }
    return 0;
}