[Permutation] swea-6808

Author: Seogeurim

README.md

@@ -193,7 +193,7 @@
 | 05  |     | [Baekjoon-11404 플로이드](./src/Graph/P11404)        |   Floyd-Warshall   |
 | 06  |     | [Baekjoon-1854 K번째 최단경로 찾기](./src/Graph/P1854)   |   Dijkstra   |
 | 07  |     | [Baekjoon-3860 할로윈 묘지](./src/Graph/P3860)        |   Bellman-Ford   |
-| 06  | ⭐️  | [Baekjoon-5719 거의 최단 경로](./src/Graph/P5719)      |   Dijkstra   |
+| 08  | ⭐️  | [Baekjoon-5719 거의 최단 경로](./src/Graph/P5719)      |   Dijkstra   |
 
 ### Union-Find
 
@@ -242,6 +242,7 @@
 | 04  |     | [Baekjoon-10973 이전 순열](./src/Permutation/P10973) |      |
 | 05  |     | [Baekjoon-10974 모든 순열](./src/Permutation/P10974) |      |
 | 06  |     | [Baekjoon-9742 순열](./src/Permutation/P9742)       |      |
+| 07  |     | [SWEA-6808 규영이와 인영이의 카드게임](./src/Permutation/swea6808)  |      |
 
 ### Probability
 

src/Permutation/swea6808/README.md

@@ -0,0 +1,6 @@
+## [SW Expert Academy - 6808] 규영이와 인영이의 카드게임
+
+![image](https://user-images.githubusercontent.com/22045163/107907524-4b5c0a00-6f97-11eb-9199-21c58a642ae3.png)
+![image](https://user-images.githubusercontent.com/22045163/107907540-557e0880-6f97-11eb-8fea-5c0e545ac5d6.png)
+
+![image](https://user-images.githubusercontent.com/22045163/107907575-675fab80-6f97-11eb-8796-dca1fe2e5b9f.png)

src/Permutation/swea6808/Solution.java

@@ -0,0 +1,65 @@
+package Permutation.swea6808;
+
+import java.io.*;
+import java.util.StringTokenizer;
+
+public class Solution {
+
+    static int T;
+    static int[] c1 = new int[9], c2 = new int[9];
+
+    public static void main(String[] args) throws Exception {
+        System.setIn(new FileInputStream("src/Permutation/swea6808/s_input.txt"));
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringBuilder sb = new StringBuilder();
+
+        T = Integer.parseInt(br.readLine());
+        for (int t = 1; t <= T; t++) {
+            StringTokenizer st = new StringTokenizer(br.readLine());
+            boolean[] nums = new boolean[19];
+            for (int i = 0; i < 9; i++) {
+                c1[i] = Integer.parseInt(st.nextToken());
+                nums[c1[i]] = true;
+            }
+
+            for (int i = 1, j = 0; i <= 18; i++) {
+                if (!nums[i]) c2[j++] = i;
+            }
+
+            int win = 0, lose = 0;
+            do {
+                int sc1 = 0, sc2 = 0;
+                for (int i = 0; i < 9; i++) {
+                    if (c1[i] > c2[i]) sc1 += c1[i] + c2[i];
+                    else sc2 += c1[i] + c2[i];
+                }
+                if (sc1 > sc2) win ++;
+                else if (sc1 < sc2) lose ++;
+            } while (np());
+
+            sb.append("#").append(t).append(" ").append(win).append(" ").append(lose).append("\n");
+        }
+
+        System.out.println(sb.toString());
+    }
+
+    static boolean np() {
+        int i = 8;
+        while (i > 0 && c2[i-1] > c2[i]) i--;
+        if (i == 0) return false;
+
+        int j = 8;
+        while (c2[i-1] > c2[j]) j--;
+        swap(i-1, j);
+
+        int k = 8;
+        while (i < k) swap(i++, k--);
+        return true;
+    }
+
+    static void swap(int i, int j) {
+        int tmp = c2[i];
+        c2[i] = c2[j];
+        c2[j] = tmp;
+    }
+}

src/Permutation/swea6808/s_input.txt

@@ -0,0 +1,5 @@
+4
+1 3 5 7 9 11 13 15 17
+18 16 14 12 10 8 6 4 2
+13 17 9 5 18 7 11 1 15
+1 6 7 9 12 13 15 17 18

src/Permutation/swea6808/s_output.txt

@@ -0,0 +1,4 @@
+#1 112097 250783
+#2 250783 112097
+#3 336560 26320
+#4 346656 16224