zoukankan      html  css  js  c++  java
  • hdu 1358Period

    Period

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 1326    Accepted Submission(s): 637


    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
     
    View Code
     1 #include<stdio.h>
     2 #include<string.h>
     3 char str[1000010];
     4 int next[1000010];
     5 void get_next(int x)
     6 {
     7     int i=0;
     8     int j=-1;
     9     next[0]=-1;
    10     while(i<x)
    11     {
    12         if(j==-1||str[i]==str[j])
    13         {
    14             i++;
    15             j++;
    16             next[i]=j;;
    17             
    18         }
    19         else j=next[j];
    20     }
    21     //return next[x];
    22 }
    23 
    24 int main()
    25 {
    26     int n;
    27     int cnt=1;
    28     int l;
    29     while(~scanf("%d",&n),n)
    30     {
    31         scanf("%s",str);
    32         get_next(n);
    33         
    34         printf("Test case #%d\n",cnt++);
    35         for(int i=2;i<=n;i++)
    36         {
    37             l=i-next[i];
    38             if(i%l==0&&i/l>1) printf("%d %d\n",i,i/l);
    39         }
    40         printf("\n");
    41     }
    42 }
  • 相关阅读:
    D3.js中对array的使用
    kibana中信息分类查询显示的方法
    JAVA异常机制简述
    Google Web Toolkit(GWT) 在windows下环境搭建
    zico源代码分析(二) 数据读取和解析部分
    zico源代码分析(一) 数据接收和存储部分
    eclipse中导入zico Maven项目
    Zorka和zico实现不同主机之间的交互
    【转载】使用logstash+elasticsearch+kibana快速搭建日志平台
    LA 3644 易爆物 并查集
  • 原文地址:https://www.cnblogs.com/1114250779boke/p/2664410.html
Copyright © 2011-2022 走看看