CodeForces 548A Mike and Fax (回文)

来源：互联网发布：ubuntu kali工具包编辑：程序博客网时间：2024/05/15 04:05

#include<stdio.h>#include<iostream>#include<math.h>#include<string.h>#include<iomanip>#include<stdlib.h>#include<ctype.h>#include<algorithm>#include<deque>#include<functional>#include<iterator>#include<vector>#include<list>#include<map>#include<queue>#include<set>#include<stack>#define CPY(A, B) memcpy(A, B, sizeof(A))typedef long long LL;typedef unsigned long long uLL;const int MOD = int (1e9) + 7;const int INF = 0x3f3f3f3f;const LL INFF = 0x3f3f3f3f3f3f3f3fLL;const double EPS = 1e-9;const double OO = 1e20;const double PI = acos (-1.0);const int dx[] = {-1, 0, 1, 0};const int dy[] = {0, 1, 0, -1};using namespace std;const int maxn = 1010;char str[maxn];bool isPalind (int l,int r) {    while (l<r) {        if (str[l]!=str[r]) { return false; }        ++l; --r;    }    return true;}int main() {    while (~scanf ("%s",str) ) {        int k; cin>>k;bool f=false;        int len=strlen (str);        if (len%k!=0) {printf ("NO\n"); break;}        int l=len/k;//先把字符串分段        for (int i=0; i<len; i++) {            if (i%l==0) {//判断每一段是否是回文串                if (isPalind (i,i+l-1) ) { f=true ; }                else { f=false; break; }            }        }        (f) ?printf ("YES\n") :printf ("NO\n");    }    return 0;}

0 0