Submission #2500157

---

Source Code Expand

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <numeric>
#include <queue>
#include <map> 
#include <set>
#include <string>
#include <functional>
#include <list>
#include <random>
#include <time.h>
#define int long long
#define oku7 1000000007
#define MAXN (int)1e+5 * 2+1
#define LL_MAX 9223372036854775807	//ない環境用
using namespace std;
std::mt19937 mt((int)time(0));

int dx[4] = { 0, 1, 0,-1 }; // x軸方向への変位
int dy[4] = { 1, 0,-1, 0 }; // y軸方向への変位





signed main() {
	string s;
	set<char> charSet;
	set<string> ansSet;
	int K;
	cin >> s >> K;
	for (int i = 0; i < (int)s.size(); i++) {
		charSet.insert(s[i]);
	}
	for (char c : charSet) {
		if (ansSet.size() > K) break;
		
		for (int i = 0; i < (int)s.size(); i++) {
			if (s[i] == c) {
				for (int j = i; j < (int)s.size(); j++) {
					
					string str = s.substr(i, j - i + 1);
					if ((int)str.size() > K) break;
					ansSet.insert(str);
				}
			}
		}

	}
	int count = 0;
	for (string st : ansSet) {
		count++;
		if (count == K) cout << st << "\n";
	}


	return 0;




}

Submission Info

Judge Result