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

A. Mike and Fax

time limit per test : 1 second

memory limit per test : 256 megabytes

input : standard input

output : standard 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 strings.

He is not sure if this is his own back-bag or someone else's. He remembered that there were exactlykmessages 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 strings 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".

题意：给出一串字符串 s 和 整数 k 。判断字符串中是否含有 k 个相同长度的回文字符串。

首先判断长度为 l = s.size() 的字符串能不能分成 k 个相同长度的字符串，然后再判断是否回文字符串。

#include<cstdio>
#include<cstring>
#include<iostream>
#include<utility>
#include<string>
#include<vector>
#include<algorithm>
#include<queue>
#include<cstdlib>
#include<cmath>
#include<stack>

using namespace std;

int main()
{
	string s ;
	int k ;
	while(cin >> s >> k)
	{
		int l = s.size() ;
		if(l % k)
			printf("NO\n");
		else
		{
			int n = l / k , i , j , ok = 1 ;
			for(i = 0 ; i < l ; i += n)
			{
				for(j = 0 ; j < n/2 ; ++j)
				{  
					if(s[i + j] != s[i + n - j - 1])
					{
						ok = 0 ;
						break;
					}
				}
				if(!ok)
					break;
			}
			if(ok)
				printf("YES\n");
			else
				printf("NO\n");
		}
	}

	return 0;
}