백준 15666번 N과 M (12)

문제 링크: https://www.acmicpc.net/problem/15666

Author: skysign

백준 15666번 N과 M (12)/main.py

@@ -0,0 +1,30 @@
+import sys
+from typing import List, Tuple, Set
+
+
+def solve():
+    N, M = map(int, sys.stdin.readline().strip().split(' '))
+    dts: List[int] = list(map(int, sys.stdin.readline().strip().split(' ')))
+    ans: Set[Tuple] = set()
+
+    mycomb(dts, 0, M, ans, [])
+
+    ans: List[Tuple] = list(ans)
+    ans.sort()
+
+    for item in ans:
+        print(' '.join(map(str, item)))
+
+
+def mycomb(dts: List[int], depth: int, depth_max: int, ans: Set[Tuple], path: List[int]):
+    if depth == depth_max:
+        path.sort()
+        ans.add(tuple(path))
+        return
+
+    for idx in range(len(dts)):
+        mycomb(dts, depth + 1, depth_max, ans, path + [dts[idx]])
+
+
+if __name__ == '__main__':
+    solve()

백준 15666번 N과 M (12)/test1.txt

@@ -0,0 +1,2 @@
+3 1
+4 4 2

백준 15666번 N과 M (12)/test1_answer.txt

@@ -0,0 +1,2 @@
+2
+4

백준 15666번 N과 M (12)/test2.txt

@@ -0,0 +1,2 @@
+4 2
+9 7 9 1

백준 15666번 N과 M (12)/test2_answer.txt

@@ -0,0 +1,6 @@
+1 1
+1 7
+1 9
+7 7
+7 9
+9 9

백준 15666번 N과 M (12)/test3.txt

@@ -0,0 +1,2 @@
+4 4
+1 1 2 2

백준 15666번 N과 M (12)/test3_answer.txt

@@ -0,0 +1,5 @@
+1 1 1 1
+1 1 1 2
+1 1 2 2
+1 2 2 2
+2 2 2 2

백준 15666번 N과 M (12)/test_main.py

@@ -0,0 +1,29 @@
+import sys
+from pathlib import Path
+from unittest import TestCase
+from main import solve
+
+
+class Test(TestCase):
+    def my_solve(self, testcase_input):
+        sys.stdin = open(testcase_input, 'r')
+        stdout = sys.stdout
+        sys.stdout = open('stdout.txt', 'w')
+        solve()
+        sys.stdout.close()
+        sys.stdout = stdout
+
+    def test_solve(self, testcase_number: str):
+        self.my_solve('test' + testcase_number + '.txt')
+        self.assertEqual(
+            Path('test' + testcase_number + '_answer.txt').read_text().strip(),
+            Path('stdout.txt').read_text().strip())
+
+    def test1_solve(self):
+        self.test_solve('1')
+
+    def test2_solve(self):
+        self.test_solve('2')
+
+    def test3_solve(self):
+        self.test_solve('3')