Submission #2495080

---

Source Code Expand

#include<vector>
#include<cmath>
#include<map>
#include<cstdlib>
#include<iostream>
#include<sstream>
#include<fstream>
#include<string>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<set>
#include<stack>
#include<bitset>
#include<functional>
#include<ctime>
#include<queue>
#include<deque>
#include<complex>
#include<cassert>
using namespace std;
#define pb push_back
#define pf push_front
typedef long long lint;
typedef complex<double> P;
#define mp make_pair
#define fi first
#define se second
typedef pair<int,int> pint;
#define All(s) s.begin(),s.end()
#define rAll(s) s.rbegin(),s.rend()
#define REP(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
vector<string> v;
int main()
{
	string s;cin>>s;
	int k,n=s.size();cin>>k;
	rep(i,n) REP(j,1,k+1){
		if(i+j<=n) v.pb(s.substr(i,j));
	}
	sort(All(v));
	v.erase(unique(All(v)),v.end());
	//rep(i,v.size()) cout<<v[i]<<endl;
	cout<<v[k-1]<<endl;
}

Submission Info

Judge Result