zoukankan      html  css  js  c++  java
  • hdu1358

    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 A K , 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
    #include<stdio.h>
    
    int next[1000005],len;
    void set_naxt(char str[])
    {
        int i=0,j=-1;
        next[0]=-1;
        while(i<len)
        {
            if(j==-1||str[i]==str[j])
            {
                i++; j++;
                next[i]=j;
                if(i%(i-next[i])==0&&i/(i-next[i])>1)
                printf("%d %d
    ",i,i/(i-next[i]));//i-next[i]就是循环节点
            }
            else
            j=next[j];
        }
    }
    int main()
    {
        char str[1000000];
        int k=1,i;
        while(scanf("%d",&len)&&len)
        {
            getchar();
            scanf("%s",str);
    
            printf("Test case #%d
    ",k++);
            set_naxt(str);
            printf("
    ");
        }
    }
    


  • 相关阅读:
    基于UDP的聊天室一例
    用原始套接字编程实现linux中的 ping 命令
    UNIX域流式套接字一例
    基于TCP的多进程echo服务器
    网络数据包检测抓包一例
    Java中static、final用法小结
    TCP/IP 组播的发送和接收
    Java数据库连接字符串
    对java中的访问限定符的理解1
    UNIX域用户数据报套接字一例
  • 原文地址:https://www.cnblogs.com/jiangu66/p/3220317.html
Copyright © 2011-2022 走看看