-
Notifications
You must be signed in to change notification settings - Fork 0
/
swexpert_1257.java
63 lines (56 loc) · 1.51 KB
/
swexpert_1257.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
package com.ssafy.algo;
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.Comparator;
import java.util.HashSet;
import java.util.PriorityQueue;
import java.util.Set;
import java.util.TreeSet;
public class swexpert_1257 {
public static void main(String[] args) throws NumberFormatException, IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
int T = Integer.parseInt(br.readLine());
for(int tc = 1; tc <= T; ++tc) {
// data input
int N = Integer.parseInt(br.readLine());
String str = br.readLine();
// solve
bw.write("#" + tc + " " + solve(N, str) + "\n");
}
// flush data
bw.flush();
bw.close();
br.close();
}
private static String solve(int n, String str) {
Set<String> sets = new TreeSet<>(new Comparator<String>() {
@Override
public int compare(String o1, String o2) {
return o1.compareTo(o2);
}
});
// add substring by ascending
int cnt = 1;
while(cnt != str.length() + 1) {
for(int i = 0; i < str.length(); ++i) {
if(i + cnt <= str.length())
sets.add(str.substring(i, i + cnt));
}
++cnt;
}
// extract result
String result = "none";
int i = 0;
for(String s : sets) {
if(++i == n) {
result = s;
break;
}
}
return result;
}
}