习题3-4 Periodic Strings UVa455
2018-03-27 11:18
330 查看
题目链接:https://vjudge.net/problem/19496/origin
暴力枚举可能的周期(必须被长度整除)
上代码
暴力枚举可能的周期(必须被长度整除)
上代码
#include <iostream> #include <cstdio> #include <cstring> #include <cmath> #include <algorithm> using namespace std; int T; char s[85]; int main(){ scanf("%d\n",&T); while(T--){ scanf("%s",&s); int len=strlen(s); for(int k,i=1;i<=len;i++){ if(len%i==0){ for(k=i;k<len;k++){ if(s[k]!=s[k%i]){ break; } } if(k==len){ printf("%d\n",i); break; } } } if(T) printf("\n");//注意题目输出要求 } return 0; }
相关文章推荐
- 【习题 3-4 UVA - 455】Periodic Strings
- 习题3-4 UVa455 Periodic Strings
- UVa 455:Periodic Strings
- Problem 010——UVa 455 - Periodic Strings
- UVa 455 - Periodic Strings
- UVa 455 - Periodic Strings
- UVa 455 - Periodic Strings
- UVA - 455 Periodic Strings
- UVA - 455 Periodic Strings
- UVa455 Periodic Strings
- UVA 455 Periodic Strings
- UVA455 Periodic Strings
- UVa455--Periodic Strings
- UVa 455 - Periodic Strings【字符串】
- UVA 455 - Periodic Strings
- UVa455 Periodic Strings
- UVA-455 Periodic Strings
- UVa455 Periodic Strings
- UVa 455 Periodic Strings
- 算法竞赛入门经典第三章3-4 Periodic Strings UVA - 455