POJ 2406 Power Strings——字符串哈希

传送门

Description
Given two strings a and b we define ab to be their concatenation. For example, if a = “abc” and b = “def” then ab = “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

题意： 判断字符串最多由多少个子串重复而组成。

#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
typedef unsigned long long ull;

int ans, sum, len;
char s[1000005];
ull has[1000005];
int main(){
    while(~scanf("%s", s+1) && s[1]!='.'){
        sum = ans = 1;
        len = strlen(s+1);
        for (int i = 1; i <= len; i++)
            has[i] = has[i-1] * 131 + s[i] - 'a';
            
        ull tem = 1;
        for (int l = 1; l <= len; l++){
            tem *= 131;
            if(len % l)    continue;
            int p = sum = 1;
            while (p+l <= len){
                ull a = has[p + l - 1] - has[p - 1] * tem;
                ull b = has[p + 2 * l - 1] - has[p + l - 1] * tem;
                if(a != b){
                    sum = 1;
                    break;
                }
                sum++;
                p += l;
            }
            if(ans < sum){
                ans = sum;
                break;
            }
        }
        printf("%d\n", ans);
    }
    return 0;
}