Skip to content

Commit 8b61a53

Browse files
committed
1024
1 parent 8e09685 commit 8b61a53

File tree

1 file changed

+38
-38
lines changed

1 file changed

+38
-38
lines changed

BOJ/silver/BOJ10973/src/Main.java

Lines changed: 38 additions & 38 deletions
Original file line numberDiff line numberDiff line change
@@ -24,42 +24,42 @@ public static void main(String[] args) throws IOException {
2424

2525
}
2626

27-
private static void perm(int[] visited, int[] find, int[] num, int n, int r, int count) {
28-
if(n==r){
29-
result.add(find.clone());
30-
int same=0;
31-
for (int i = 0; i < find.length; i++) {
32-
if(find[i]==num[i]){
33-
same+=1;
34-
}
35-
}
36-
37-
if(same==n){
38-
sameIdx=step;
39-
if (sameIdx==0){
40-
System.out.println(-1);
41-
}else{
42-
43-
int [] tmp = result.get((sameIdx-1));
44-
StringBuilder sb =new StringBuilder();
45-
for (int i = 0; i < tmp.length; i++) {
46-
sb.append(tmp[i]+" ");
47-
}
48-
System.out.println(sb.toString());
49-
}
50-
System.exit(0);
51-
}
52-
step+=1;
53-
return;
54-
}
55-
for (int i = 0; i < n; i++) {
56-
if(visited[i]==0){
57-
visited[i]=1;
58-
find[r]=i+1;
59-
perm(visited, find, num, n, r+1, count+1);
60-
visited[i]=0;
61-
}
62-
63-
}
64-
}
27+
// private static void perm(int[] visited, int[] find, int[] num, int n, int r, int count) {
28+
// if(n==r){
29+
// result.add(find.clone());
30+
// int same=0;
31+
// for (int i = 0; i < find.length; i++) {
32+
// if(find[i]==num[i]){
33+
// same+=1;
34+
// }
35+
// }
36+
//
37+
// if(same==n){
38+
// sameIdx=step;
39+
// if (sameIdx==0){
40+
// System.out.println(-1);
41+
// }else{
42+
//
43+
// int [] tmp = result.get((sameIdx-1));
44+
// StringBuilder sb =new StringBuilder();
45+
// for (int i = 0; i < tmp.length; i++) {
46+
// sb.append(tmp[i]+" ");
47+
// }
48+
// System.out.println(sb.toString());
49+
// }
50+
// System.exit(0);
51+
// }
52+
// step+=1;
53+
// return;
54+
// }
55+
// for (int i = 0; i < n; i++) {
56+
// if(visited[i]==0){
57+
// visited[i]=1;
58+
// find[r]=i+1;
59+
// perm(visited, find, num, n, r+1, count+1);
60+
// visited[i]=0;
61+
// }
62+
//
63+
// }
64+
//}
6565
}

0 commit comments

Comments
 (0)