UVA 455 – Periodic Strings

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

原创最新推荐文章于 2021-12-27 14:19:08 发布 · 389 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#uva

UVA 专栏收录该内容

13 篇文章

订阅专栏

本文介绍了一个用于确定给定字符串最小周期的程序实现方法。通过读取一系列字符串，并判断每个字符串是否存在周期性重复，进而找出最小的重复周期。

A character string is said to have period k if it can be formed by concatenating one or more repetitions of another string of length k. For example, the string "abcabcabcabc"has period 3, since it is formed by 4 repetitions of the string "abc". It also has periods 6 (two repetitions of "abcabc") and 12 (one repetition 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 your program will test followed by a blank line. Each test case will contain a single character string
of up to 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 are separated by a blank line.

Sample Input

1

HoHoHo

Sample Output

如果一个字符串可以由某个长度为k的字符串重复多次得到，则称该串以k为周期。输入一个字符串输出最小周期。

 
  
   
    [cpp] 
    view plain
     copy
    
     
   
  
  #include <iostream>  
using namespace std;  
int compare(string s,int a,int b)  
{  
if(s.length()%(b-a)!=0) return 0;//如果不满足周期串的要求，还未比较完字符串就已经结束。比如：abcdabcdabc、aabaa  
for(int i=1;i<s.length()-b;i++)  
    {     if(s[a+i]!=s[b+i])//一旦有不相等的字符出现，返回假  
    return 0;  
    }  
    return 1;  
}  
int main(){  
int T;  
int flag=0;  
cin>>T;  
while(T--)  
{string s;  
cin>>s;  
int res=0;  
for(int i=1;i<s.length();i++)  
{  
if(s[0]==s[i]) {if(res=compare(s,0,i)) { if(flag) cout<<endl;  
    flag=1;    cout<<i<<endl; break;}    }  
}  
if(!res) {if(flag) cout<<endl; cout<<s.length()<<endl;  
    flag=1; }  
}  
return 0;  
}