K-th Substring

http://icpc.upc.edu.cn/problem.php?cid=1704&pid=4

#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
string s0;
int k,k1;
void dfs(string s) {
    for(char i='a'; i<='z'; i++) {
        string s1=s+i;
        if (k1==k)return;
        if(s0.find(s1)==string::npos) {
        } else {
            k1++;
            if(k1==k) {
                cout<<s1<<endl;
                return;
            }
            dfs(s1);
        }
    }
}
int main() {
    cin>>s0;
    cin>>k;
    dfs("");
}

猜你喜欢

转载自blog.csdn.net/weixin_43601103/article/details/88376234