Period[HDU1358]
Period
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 2120 Accepted Submission(s): 1039
Problem Description For each prefix of a given string S with N characters (each character has an ASCII code between 97 and 126, inclusive), we want to know whether the prefix is a periodic string. That is, for each i (2 <= i <= N) we want to know the largest K > 1 (if there is one) such that the prefix of S with length i can be written as AK , that is A concatenated K times, for some string A. Of course, we also want to know the period K.
Input The input file consists of several test cases. Each test case consists of two lines. The first one contains N (2 <= N <= 1 000 000) – the size of the string S. The second line contains the string S. The input file ends with a line, having the number zero on it.
Output For each test case, output “Test case #” and the consecutive test case number on a single line; then, for each prefix with length i that has a period K > 1, output the prefix size i and the period K separated by a single space; the prefix sizes must be in increasing order. Print a blank line after each test case.
Sample Input
3
aaa
12
aabaabaabaab
0
Sample Output
Test case #1
2 2
3 3
Test case #2
2 2
6 2
9 3
12 4
Recommend JGShining
#include<stdio.h>
#include<string.h>
#define gs 1000010
int next[gs];
char str[gs];
void GetNext(char * str,int * next)
{
int N=strlen(str+);
next[]=;
int j=;
for(int i=;i<=N;i++)
{
while(j> && str[j+]!=str[i]) j=next[j];
if(str[j+]==str[i]) j+=;
next[i]=j;
}
}
int main()
{
int N,cas=;
while (scanf("%d",&N)!=EOF)
{
if (N==) return ;
cas++;
printf("Test case #%d\n",cas);
scanf("%s",str+);
GetNext(str,next);
for (int i=;i<=N;i++)
if (i%(i-next[i])== && i/(i-next[i])>) printf("%d %d\n",i,i/(i-next[i]));
printf("\n");
}
return ;
}
最新文章
- SQL Server中行列转换 Pivot UnPivot
- WebAPi添加常用扩展方法及思维发散
- 扁平设备树(FDT)
- XML dom
- Hadoop学习资料
- Java原来如此-比较器(Comparable、Comparator)
- pycharm上运行django服务器端、以及创建app方法
- (转载)PHP获取客户端、PHP获取服务器相关信息
- PHP安全编程:shell命令注入(转)
- Dedecms调用文章发布时间的方法
- java设计模式之Proxy(代理模式)
- 由href return false 来看阻止默认事件
- fetch默认不携带cookie
- echarts-饼状图默认选中高亮
- Netty实战十一之预置的ChannelHandler和编解码器
- MSSQL无法启动-原来电脑登录密码改了,重启后要设置
- Tickets HDU - 1260 水DP
- Confluence 6 使用一个主题到站点
- 用图片作为label,for属性IE下不起作用
- jeecg 主-附表生成代码例子