sdutacm-Power Strings

最新推荐文章于 2019-08-29 12:52:04 发布

axuhongbo

最新推荐文章于 2019-08-29 12:52:04 发布

阅读量281

点赞数

分类专栏： ACM《数据结构》串、数组文章标签： acm sdut c语言算法

本文链接：https://blog.csdn.net/axuhongbo/article/details/60781481

版权

ACM《数据结构》串、数组专栏收录该内容

16 篇文章 0 订阅

订阅专栏

Power Strings

Time Limit: 1000MS Memory Limit: 65536KB

SubmitStatistic

ProblemDescription

Given two strings a and b we define a*b to be theirconcatenation. For example, if a = "abc" and b = "def" thena*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 ofprintable characters. The length of s will be at least 1 and will not exceed 1 millioncharacters. 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 forsome string a.

ExampleInput

abcd

aaaa

ababab

.

ExampleOutput

Hint

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

Author

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<queue>
#include<math.h>
#include<iostream>
#include<algorithm>
using namespace std;
#define N 1000005
int main()
{
  int num[N];
  char s[N];
  int n;
  while(scanf("%s",s),s[0]!='.')// 逗号表达式代替 if break
  {
     int j = -1;//j 表示前缀，i 表示后缀
     num[0] = -1;
     n = strlen(s);
     for(int i=0;i<n;)
     {
        if(j == -1||s[i] == s[j])num[++i] = ++j;
        else j = num[j];
     }
     if(n%(n-num[n])==0)  //解决特例 aabaabaa abcabcabc(符合条件)
     printf("%d\n",n/(n-num[n]));
     else puts("1");

  }
  return 0;
}


/***************************************************
User name: jk160505徐红博
Result: Accepted
Take time: 64ms
Take Memory: 940KB
Submit time: 2017-02-08 20:21:20
****************************************************/