uvaoj-455:周期串
2016-02-02 20:33
344 查看
A character string is said to have periodk if it can be formed
by concatenating one or more repetitions of another string of lengthk. 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.
string of up to 80 non-blank characters. Two consecutive input will separated by a blank line.
code:(仿照别的大神博客上的代码写得)
#include <cstdio>
#include <cstring>
int main()
{
int c;
char s[85];
scanf("%d",&c);
while(c--)
{
scanf("%s",s);//用gets不能过,可能是uva编译器不接受gets吧?
int len=strlen(s);
for(int i=1; i<=len; i++)
{
if(len%i==0)//判断len能否被i整除,只有整除才有成为周期的可能;
{
int j;
for(j=i; j<len ;j++)
{
if(s[j%i]!=s[j])//每次都是和第一个周期的字符做比较;
{
break;
}
}
if(j==len)
{
printf("%d\n",i);
break;
}
}
}
if(c) printf("\n");
}
}
by concatenating one or more repetitions of another string of lengthk. 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 characterstring 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
题意:简单的说就是求最小周期串的周期,因为数据量小,最多只有80,所以用枚举的方法,将每一个数据都判断一 次;
code:(仿照别的大神博客上的代码写得)
#include <cstdio>
#include <cstring>
int main()
{
int c;
char s[85];
scanf("%d",&c);
while(c--)
{
scanf("%s",s);//用gets不能过,可能是uva编译器不接受gets吧?
int len=strlen(s);
for(int i=1; i<=len; i++)
{
if(len%i==0)//判断len能否被i整除,只有整除才有成为周期的可能;
{
int j;
for(j=i; j<len ;j++)
{
if(s[j%i]!=s[j])//每次都是和第一个周期的字符做比较;
{
break;
}
}
if(j==len)
{
printf("%d\n",i);
break;
}
}
}
if(c) printf("\n");
}
}
相关文章推荐
- 获取JNDI数据源
- spring注解事务管理
- CDlinux U盘启动盘
- Spring切入点表达式常用写法
- 深入三层
- 使用CSS实现鼠标悬停在一行上,显示某些元素
- JPA和事务管理
- ssh远程执行shell实例
- maven仓库
- Android进阶自定义控件之五子棋盘
- (2)第一个shell脚本和shell变量
- html中的table在android端显示
- (C++) 分隔符匹配
- Linux---用户登陆查看
- linxu的文件类型和扩展名
- struts2拦截器
- 递归调用图例
- Cocos Creator 的属性创建
- POJ1094 Sorting It All Out(拓扑排序)
- struts2上传文件