Submission #2495099

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
int k,la;
string s,a[55555];
int main(){
	cin >> s >> k;
	int n = s.length();
	for(int l=1; l<=k; l++)
	for(int i=0; i+l<=n; i++)
		a[la++] = s.substr(i,l);
	sort(a,a+la);
	unique(a,a+la);
	cout << a[k-1] << endl;
	return 0;
}

Submission Info

Judge Result