Codeforces Round #506 (Div. 3) A. Many Equal Substrings(KMP next数组)

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

Copy

3 4
aba

output

Copy

ababababa

input

Copy

3 2
cat

output

Copy

catcat

代码如下:

#include<iostream>
#include<string>
#include<cstring>
using namespace std;
string a;
int ne[500];
int nn[500];

void getNe(int n) {
    int i = 1, j = 0;
    ne[i] = j;
    while (i <= n) {
        if(j == 0 || a[i - 1] == a[j - 1]) {
            nn[i] = j;
            ne[++i] = ++j;
        }
        else
            j = ne[j];
    }
}

int main() {
    ios::sync_with_stdio(false);
    cout.tie(nullptr);

    memset(ne, 0, sizeof(ne));

    int n, k;
    cin >> n >> k;
    cin >> a;

    getNe(n);

    cout << a;
    for (int i = 1; i < k; i ++) {
        for (int j = nn[n]; j < n; j ++)
            cout << a[j];
    }

        return 0;
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值