zoukankan      html  css  js  c++  java
  • CodeForces A. Many Equal Substrings

    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[lr]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[ii+n1]=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 (1n,k501≤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 <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;
    }
    

      

  • 相关阅读:
    专题页移动端适配实例
    iconfont字体图标使用方法
    HBuilder常用快捷键
    tab
    tab-qq
    微信小程序之购物车功能
    margin塌陷
    weui-wxss-master下载地址
    python_vlc 播放http流
    go学习笔记-简述
  • 原文地址:https://www.cnblogs.com/zlrrrr/p/9822818.html
Copyright © 2011-2022 走看看