codeforces 548A-CSDN博客

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.

$\text{[math]}$

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".

同样暴力，这题开始题目看错没看到每个回文串相等，浪费了不少时间。

--------------------------------------------------------------------------------------------

题解：

 1 #include<cstdio>
 2 #include<stdbool.h>
 3 #include<string.h>
 4 bool is[1001][1001];
 5 char a[1001];
 6 int n;
 7 int lena;
 8 bool flag;
 9 int main()
10 {
11     scanf("%s",a);
12     scanf("%d",&n);
13     lena=strlen(a);
14     for(int i=1;i<=lena;i++)
15     is[i][i]=1;
16     for(int i=1;i<=lena-1;i++)
17     if(a[i-1]==a[i])
18     is[i][i+1]=1;
19     for(int len=2;len<=lena-1;len++)
20     for(int i=1;i+len<=lena;i++)
21     {
22         if(a[i-1]==a[i+len-1])
23         is[i][i+len]=is[i+1][i+len-1];
24     }
25     int sum=0;
26     if(lena%n)
27     flag=0;
28     else
29     {
30         for(int i=1;i<=n;i++)
31         if(is[i*(lena/n)-(lena/n-1)][i*lena/n])
32         sum++;
33     }
34     if(sum==n)
35     flag=1;
36     if(flag)
37     printf("YES");
38     else
39     printf("NO");
40 }