Codeforces Round #305 (Div. 2)A. Mike and Fax

time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output

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.

Input
The first line of input contains string s containing lowercase English letters (1 ≤ |s| ≤ 1000).

The second line contains integer k (1 ≤ k ≤ 1000).

Output
Print “YES”(without quotes) if he has worn his own back-bag or “NO”(without quotes) otherwise.

Sample test(s)
input
saba
2
output
NO
input
saddastavvat
2
output
YES
Note
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”.

这道题的意思是给你一个字符串和一个整数N，判断这个字符串里面有没有N个长度相同的回文串，一开始是不知道是找相同长度的回文串，绕了弯路，后来知道了，可是老是在第52个样例中WA，然后才发现是judge函数写错了，是判断回文串时的中间判断错了，改好就可以了。

#include<iostream>
#include<string.h>
#include<stdio.h>
using namespace std;
char str[1010];
int judge(int a,int b)   //前者为起始位置，后者为长度 
{
    int half=b/2;
    for(int i=a,j=a+b-1;i<half+a;i++,j--)
    {
        if(str[i]!=str[j])  return 0;
    }
    return 1;
}
int main()
{
    int n;
    gets(str);
    cin>>n;
    getchar();
    int len=strlen(str);
    int ans=0;
    int count=0;
    if(len%n!=0)  cout<<"NO"<<endl;
    else 
    {
        int length=len/n;
        while(ans<len)
        {
            if(!judge(ans,length)) 
            {
                count=1;
                break;
            } 
            ans+=length;
        }
        if(count==0)  cout<<"YES"<<endl;
        else  cout<<"NO"<<endl;
    }
    return 0;
}