-
Notifications
You must be signed in to change notification settings - Fork 34
/
D.java
45 lines (40 loc) · 1.41 KB
/
D.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
import java.io.PrintStream;
import java.util.*;
/**
* Codejam to I/O for Women 2016 Problem D: Password Security
* Check README.md for explanation.
*/
public class Main {
private String solve(Scanner scanner) {
int n=scanner.nextInt();
String[] ans=new String[n];
for (int i=0;i<n;i++) ans[i]=scanner.next();
for (int i=1;i<=100000;i++) {
ArrayList<String> arrayList=new ArrayList<>();
for (char c='A';c<='Z';c++)
arrayList.add(String.valueOf(c));
Collections.shuffle(arrayList);
String candidate=String.join("", arrayList);
boolean able=true;
for (String s: ans) {
if (candidate.contains(s)) {
able=false;
break;
}
}
if (able) return candidate;
}
return "IMPOSSIBLE";
}
public static void main(String[] args) throws Exception {
System.setOut(new PrintStream("output.txt"));
Scanner scanner=new Scanner(System.in);
int times=scanner.nextInt();
long start=System.currentTimeMillis();
for (int t=1;t<=times;t++) {
System.out.println(String.format("Case #%d: %s", t, new Main().solve(scanner)));
}
long end=System.currentTimeMillis();
System.err.println(String.format("Time used: %.3fs", (end-start)/1000.0));
}
}