Periodic Strings (求HoHoHo字符串最小周期)

2024-06-04 16:38:43

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
2

思路主要就看题就行了：

注意：每行答案之间有一个空行。。。

AC代码：

#include<bits/stdc++.h>
using namespace std;
int main()
{int n;cin>>n;while(n--){char a[85];cin>>a;int len=strlen(a);int i,j;for(i=1;i<=len;i++)//i是重复最小的个数，也就是答案，从1开始找{if(len%i!=0)//竟然不能整除呵呵，所以i不可能是最小周期的啊continue;else{for(j=i;j<len;j++)//下标从第0到i-1是第一个周期，那就从下标i开始遍历{if(a[j]!=a[j%i])//竟然不一样，那就不成立break;}if(j==len)//成立！！{printf("%d\n",i);//i就是答案break;//找到最小的了就赶紧结束}}}if(n!=0)printf("\n");//题目要求separated by a line。。。。。真麻烦。。}return 0;
}

Periodic Strings (求HoHoHo字符串最小周期)相关推荐

C++算法9：KMP应用求字符串最小周期
1.输入重复序列的字符串,如果周期不存在,输出NO,如果周期存在,输出最小周期. 2.代码: # include <iostream> # include <string>us ...
字符串最小周期串问题
问题描述: 如果一个字符串可以由某个长度为n的字符串重复多次得到,则该串以n为周期.例如,abcabcabcabc以3为周期(注意,它也以6和12为周期). 输入一个长度不超过100的串,输出它的最小 ...
UVA455 - Periodic Strings（周期串）
题目:Periodic Strings A character string is said to have period k if it can be formed by concatenating ...
UVA - 455 Periodic Strings【字符串】
Periodic Strings UVA - 455 题目传送门题目大意:先输入一个数字n,在输入n行字符串,对每一个字符串输出其最小的周期长度,每两个输出间有一空行. AC代码: #include ...
周期串java_求最小周期串
如果一个字符串可以由某个长度为k的字符串重复多次得到,则该串以k为周期.例如,abcabcabcabc以3为周期(注意,它也以6和12为周期).输入一个长度不超过80的串,输出它的最小周期. 样例输入 ...
周期字符串的最小周期
题目描述右右喜欢听故事,但是右右的妈妈总是讲一些"从前有座山,山里有座庙,庙里有个老和尚给小和尚讲故事,讲的什么呢?从前有座山--"这样循环的故事来搪塞右右. 我们定义,如果一个 ...
UVA455 Periodic Strings【水题】
A character string is said to have period k if it can be formed by concatenating one or more repetit ...
UVA455 Periodic Strings
问题链接:UVA455 Periodic Strings.入门练习题,用C语言编写程序. 题意:如果一个串可以由长度为k的字符串重复多次连接而得到,则称该串为k周期.本题求一个串的最小周期. 程序中, ...
UVa455 Periodic Strings(kmp)
先计算字符串的前缀函数,字符串长度为n,如果,说明字符串是周期的,否则不是. 代码参考: OJ/Periodic Strings(kmp).java at master · wuli2496/OJ · ...
SZUACM集训字符串基础总结：字符串最小表示，KMP, EXKMP, Manracher, Trie树，字符串的hash; 附带一写常见的运用技巧，邝斌大佬的板子和例题[持续更新]
第一部分字符串的匹配<-------->KMP 模式匹配:子串的定位运算称为串的模式匹配或串匹配. 假设有两个串S,T,设S为主串,也称正文串,T为子串,也称为模式,在主串S中查找与模式 ...

最新文章

热门文章