标签：possible tar you sts har guarantee uniq ini www
http://codeforces.com/contest/1029/problem/A
You are given a string tt consisting of nn lowercase Latin letters and an integer number kk.
Let‘s define a substring of some string ss with indices from ll to rr as s[l…r]s[l…r].
Your task is to construct such string ss of minimum possible length that there are exactly kk positions ii such that s[i…i+n?1]=ts[i…i+n?1]=t. In other words, your task is to construct such string ss of minimum possible length that there are exactly kk substrings of ss equal to tt.
It is guaranteed that the answer is always unique.
The first line of the input contains two integers nn and kk (1≤n,k≤501≤n,k≤50) — the length of the string tt and the number of substrings.
The second line of the input contains the string tt consisting of exactly nn lowercase Latin letters.
Print such string ss of minimum possible length that there are exactly kk substrings of ss equal to tt.
It is guaranteed that the answer is always unique.
3 4
aba
ababababa
3 2
cat
catcat
代码：
#include <bits/stdc++.h>
using namespace std;
int N, M;
string s;
int main() {
scanf("%d%d", &N, &M);
cin >> s;
int temp;
for(int i = 0; i < N; i ++) {
if(s.substr(0, i) == s.substr(N - i, i))
temp = i;
}
for(int i = 1; i < M; i ++)
cout << s.substr(0, N - temp);
cout << s <<endl;
return 0;
}
CodeForces A. Many Equal Substrings
标签：possible tar you sts har guarantee uniq ini www
原文地址：https://www.cnblogs.com/zlrrrr/p/9822818.html
