백준 11726번 2×n 타일링

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

Author: skysign

백준 11726번 2×n 타일링/main.py

@@ -0,0 +1,27 @@
+import sys
+from typing import List
+
+
+def solve():
+    N = int(sys.stdin.readline().strip())
+    dp: List[int] = [0 for _ in range(N + 1)]
+
+    dp[0] = 0
+    dp[1] = 1
+    if N == 1:
+        print(dp[N])
+        return
+
+    dp[2] = 1 + dp[1]
+    if N == 2:
+        print(dp[N])
+        return
+
+    for i in range(3, N + 1):
+        dp[i] = (dp[i-1] + dp[i-2]) % 10007
+
+    print(dp[N])
+
+
+if __name__ == '__main__':
+    solve()

백준 11726번 2×n 타일링/test1.txt

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

백준 11726번 2×n 타일링/test1_answer.txt

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

백준 11726번 2×n 타일링/test2.txt

@@ -0,0 +1 @@
+9

백준 11726번 2×n 타일링/test2_answer.txt

@@ -0,0 +1 @@
+55

백준 11726번 2×n 타일링/test_main.py

@@ -0,0 +1,26 @@
+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')