UVA 455 Periodic Strings (水题)KMP小性质轻松过

最新推荐文章于 2021-12-27 14:19:08 发布

ljq真的不能再吃了

最新推荐文章于 2021-12-27 14:19:08 发布

阅读量228

点赞数

分类专栏： ACM

本文链接：https://blog.csdn.net/heucodesong/article/details/80792448

版权

ACM 专栏收录该内容

455 篇文章 0 订阅

订阅专栏

今天遇到一个曾经过去的题学了KMP以后艾玛这不是用下NEXT数组秒出吗

就重新过了一下注意如果长度-Next[长度]不能被长度整除那么就是整个是周期

A character string is said to have period k if it can be formed by concatenating one or more repetitionsof another string of length k. For example, the string ”abcabcabcabc” has period 3, since it is formedby 4 repetitions of the string ”abc”. It also has periods 6 (two repetitions of ”abcabc”) and 12 (onerepetition of ”abcabcabcabc”).

Write a program to read a character string and determine its smallest period.

Input

The first line oif the input file will contain a single integer N indicating how many test case that yourprogram will test followed by a blank line. Each test case will contain a single character string of upto 80 non-blank characters. Two consecutive input will separated by a blank line.

Output

An integer denoting the smallest period of the input string for each input. Two consecutive output areseparated by a blank line.

Sample Input

HoHoHo

Sample Output

详情见代码吧

#include <cstdio>
#include <iostream>
#include <cstring>
using namespace std;
const int maxn = 1e6+5;
    int Next[maxn];
    char mo[maxn];
    int n2;
    void GetNext()
    {
        int i=0,j=-1;
        while(i<n2)
        {
            if(j==-1||mo[i]==mo[j]) {++i,++j,Next[i]=j;}
            else j=Next[j];
        }
        return ;
    }

    int main()
    {
        int n;
        scanf("%d",&n);
        while(n--){
        scanf("%s",mo);
        n2=strlen(mo);
        Next[0]=-1;
        GetNext();
        if((n2%(n2-Next[n2]))!=0) printf("%d\n",n2);
        else printf("%d\n",n2-Next[n2]);
        if(n!=0) printf("\n")
        }
        return 0;
    }