Codeforces548A:Mike and Fax
来源:互联网 发布:从入门到放弃系列 知乎 编辑:程序博客网 时间:2024/04/29 03:13
While Mike was walking in the subway, all the stuff in his back-bag dropped on the ground. There were several fax messages among them. He concatenated these strings in some order and now he has string s.
He is not sure if this is his own back-bag or someone else's. He remembered that there were exactly k messages in his own bag, each was a palindrome string and all those strings had the same length.
He asked you to help him and tell him if he has worn his own back-bag. Check if the given string s is a concatenation of k palindromes of the same length.
The first line of input contains string s containing lowercase English letters (1 ≤ |s| ≤ 1000).
The second line contains integer k (1 ≤ k ≤ 1000).
Print "YES"(without quotes) if he has worn his own back-bag or "NO"(without quotes) otherwise.
saba2
NO
saddastavvat2
YES
Palindrome is a string reading the same forward and backward.
In the second sample, the faxes in his back-bag can be "saddas" and "tavvat".
题意:
给出一个字符串,判断是不是由k个等长回文串组成的
思路:
水题,暴力
#include <iostream>#include <stdio.h>#include <string.h>#include <stack>#include <queue>#include <map>#include <set>#include <vector>#include <math.h>#include <bitset>#include <algorithm>#include <climits>using namespace std;#define LS 2*i#define RS 2*i+1#define UP(i,x,y) for(i=x;i<=y;i++)#define DOWN(i,x,y) for(i=x;i>=y;i--)#define MEM(a,x) memset(a,x,sizeof(a))#define W(a) while(a)#define gcd(a,b) __gcd(a,b)#define LL long long#define N 500005#define MOD 1000000007#define INF 0x3f3f3f3f#define EXP 1e-8#define lowbit(x) (x&-x)char str[1005];int len;int main(){ int i,j,k; while(~scanf("%s%d",str,&k)) { len = strlen(str); if(len%k) { printf("NO\n"); continue; } int r = len/k,flag = 0; for(i = 0; i<len; i+=r) { for(j=i; j<i+r; j++) { if(str[j]!=str[(i+r)-1-j+i]) { flag = 1; break; } } if(flag) break; } if(flag) printf("NO\n"); else printf("YES\n"); } return 0;}
- Codeforces548A:Mike and Fax
- A. Mike and Fax
- Mike and Fax
- A. Mike and Fax
- Codeforces 548 A. Mike and Fax
- coderforce 548A. Mike and Fax
- CodeForces 548A Mike and Fax (回文)
- 【codeforces 548A】Mike and Fax
- CF Mike and Fax 字符串组成
- Codeforces Round #305 (Div. 2) A. Mike and Fax
- Codeforces Round #305 (Div. 2), problem: (A) Mike and Fax
- Codeforces Round #305 (Div. 2)--A. Mike and Fax
- Codeforces Round #305 (Div. 2)A. Mike and Fax
- cf#305-A. Mike and Fax-回文串水题
- Codeforces Round #305 (Div. 2)- Mike and Fax(分段找回文串)
- Fax CED and CNG tones
- CodeForces 548AMike and Fax
- fax
- GRE issue写作范文:竞争利弊问题
- 全球移动应用用户参与度分析
- PHP 数组操作方法
- DB2命令窗口和命令行处理器
- 逆波兰表示法
- Codeforces548A:Mike and Fax
- Qt Runtime Error ! R6025 - pure virtual function call
- BEX错误记录
- [APIO2015]巴厘岛的雕塑(数位dp)
- 二叉树解析实现逆波兰公式算法
- 关于const变量的思考
- android listview 解决数据重复
- 缓存的常见问题
- JQuery的Ajax跨域请求的