Submission #2786798

---

Source Code Expand

#include<cstdio>
#include<cstring>
#include<cmath>
#include<utility>
#include<algorithm>
#include<iostream>
#include<vector>
using namespace std;
string s,a[100];
int main()
{
	cin>>s;
	int k ;cin>>k;
	int n = s.length();
	int cur = 0;
	for(int i=0;i<n;i++)
	{
		for(int j=1;j<=min(5,n-i);j++)
		{
			a[cur+j] = s.substr(i,j);
		}
		cur += min(5,n-i);
		sort(a+1,a+1+cur);
		cur = unique(a+1,a+1+cur) - a - 1;
		if(cur>k)cur = k;
	}
	cout << a[k] << endl;
	return 0;
}

Submission Info

Judge Result