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.
Input
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.
Output
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.
Examples
Input 3 4aba Output ababababa Input 3 2cat Output catcat #include <cstdio> #include <iostream> #include <cmath> #include <string> #include <cstring> #include <algorithm> #include <queue> using namespace std; int main() { int n, k, miao; string s, t; while(~scanf("%d%d", &n, &k) && (n+k)) { cin >> s; miao = 0; for(int i = 1; i<n; i++) { t = s.substr(i); if(s.find(t) == 0) { miao = i; break; } } if(miao) { string root = s.substr(0, miao); for(int i = 0; i<k; i++) { cout << root; } cout << t << '\n'; } else { for(int i = 0; i<k; i++) { cout << s; } } } return 0; }
转载于:https://www.cnblogs.com/RootVount/p/10467406.html
相关资源：JAVA上百实例源码以及开源项目