## Welcome ! This is Guanpx's blog.

Always on the way.

# Power Strings poj2406 （kmp 进阶 next数组使用）

Power Strings
 Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 46647 Accepted: 19516

Description

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


Hint

This problem has huge input, use scanf instead of cin to avoid time limit exceed.

#include <algorithm>
#include <iostream>
#include <cstring>
#include <iomanip>
#include <string>
#include <cstdio>
#include <cmath>
#include <map>

using namespace std;

#define For(i,a,b) for(i=a;i<=b;i++)
#define _For(i,a,b) for(i=b;i>=a;i--)
#define Out(x) cout<<x<<endl
#define Outdouble(x,a) cout<<fixed<<setprecision(a)<<1.0*x<<endl
#define pf printf
#define sf scanf
#define mset(arr,num) memset(arr,num,sizeof(arr))

#define ll long long
const ll inf = 550; ///
#define ok std::ios::sync_with_stdio(0)

// #define debug
#if defined (debug)
---check---
#endif

/// ^_^  ^_^  ^_^  ^_^  ^_^  ^_^  ^_^  ^_^  ^_^  ^_^  ^_^  ^_^  ^_^ ///

int next[1000100];
string s;

void get_next()
{
int l = s.length();
int i=0,j=-1;
next[i] = j;
while(i < l)
{
if(j == -1||s[i]==s[j])
{
i++;
j++;
//next[i] = j;
if(s[i]!=s[j])
{
next[i] = j;
}
else
{
next[i]=next[j];
} ///better
}
else
{
j = next[j];
}
}
}

int main()
{
int i,num,n;
while(cin>>s)
{
if(s[0] == '.')
{
return 0;
}
int len = s.length();
get_next();
if(len%(len-next[len]) == 0)
{
cout<<len/(len-next[len])<<endl;
}
else
{
Out(1);
}
}
return 0;
}

#### POJ 2406 Power Strings--字符串哈希(bkdhash)-KMP(next)

2016-05-09 16:15:15

#### 【POJ2406】Power Strings 中文题意&题解&代码（C++）

2016-02-29 15:42:38

#### poj2406 - Power Strings - kmp，next数组

2018-05-25 20:26:04

#### POJ 2406 Power Strings hash求匹配

2017-06-13 10:03:19

#### POJ 2406 Power Strings（KMP求最小循环节）

2015-08-14 16:20:07

#### 【KMP】 poj2406 Power Strings

2012-08-02 00:05:59

#### poj2406 power strings 【KMP】

2015-08-07 16:13:11

#### poj2406 Power Strings (KMP)

2014-08-06 14:29:35

#### [poj2406]Power Strings KMP

2017-06-09 15:05:54

#### KMP，深入讲解next数组的求解

2015-04-18 16:23:05