Submission #8425730

---

Source Code Expand

#include <iostream>
#include <string>
#include <stack>
#include <queue>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <algorithm>
#include <cmath>

#include <cstdio>

using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repc(i, s, n) for (int i = (s); i <= (n); i++)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; i--)
#define rrepc(i, s, n) for (int i = (s); i >= (n); i--)
#define swap(a, b, type) { type _tmp = a; a = b; b = _tmp; }
typedef long long ll;
typedef unsigned long long ull;

int main()
{
	string s;
	int K;
	set<string> sub;
	set<string>::iterator it;

	cin >> s >> K;

	rep(i, s.size()) {
		repc(j, i, s.size()) {
			sub.insert(s.substr(i, j - i + 1));
		}
	}

	it = sub.begin();
	rep(i, K - 1) it++;

	cout << *it << endl;

	return 0;
}

Submission Info

Judge Result