字符串处理 Codeforces Round #305 (Div. 2) A. Mike and Fax

题目传送门

 /*
     字符串处理：回文串是串联的，一个一个判断
 */
 #include <cstdio>
 #include <cstring>
 #include <iostream>
 #include <algorithm>
 #include <string>
 using namespace std;

 const int MAXN = 1e3 + ;
 const int INF = 0x3f3f3f3f;
 char s[MAXN];

 bool check(int x, int y)
 {
     for (int i=x, j=y; i<j; ++i, --j)
     {
         if (s[i] != s[j])    return false;
     }

     return true;
 }

 int main(void)        //Codeforces Round #305 (Div. 2) A. Mike and Fax
 {
     int k;
     while (scanf ("%s", s) == )
     {
         scanf ("%d", &k);
         int len = strlen (s);
         if (len % k != )    puts ("NO");
         else if (len ==  && k == )    puts ("YES");
         else
         {
             int m = len / k;    bool flag = true;
             for (int i=; i<len; i+=m)
             {
                 if (!check (i, i+m-))
                 {
                     flag = false;    break;
                 }
             }
             if (flag)    puts ("YES");
             else    puts ("NO");
         }
     }

     return ;
 }