4-kokeunho

kokeunho/README.md

@@ -3,4 +3,8 @@
 | 차시 |    날짜    | 문제유형 | 링크 | 풀이 |
 |:----:|:---------:|:----:|:-----:|:----:|
 | 1차시 | 2024.09.28 |  구현  | [킹](https://www.acmicpc.net/problem/1063) | [#1](https://github.com/AlgoLeadMe/AlgoLeadMe-12/pull/1) |
+<<<<<<< Updated upstream
+=======
+| 3차시 | 2024.10.08 |  구현  | [약수들의 합](https://www.acmicpc.net/problem/9506) | [#14](https://github.com/AlgoLeadMe/AlgoLeadMe-12/pulls/14) |
+| 4차시 | 2024.10.17 |  수학  | [피보나치 수 3](https://www.acmicpc.net/problem/2749) | [#16](https://github.com/AlgoLeadMe/AlgoLeadMe-12/pull/16) |
 ---

kokeunho/구현/4-kokeunho.py

@@ -0,0 +1,19 @@
+def fibonacci(n, m):
+
+    period = [0, 1]
+
+    for i in range(2, m*m+1):
+        new_value = (period[i-1] + period[i-2]) % m
+        period.append(new_value)
+
+        if period[i] == 1 and period[i-1] == 0:
+            period = period[:-2]
+            break
+    length = len(period)
+    return period[n % length]
+
+n = int(input())
+m = 1000000
+
+result = fibonacci(n,m)
+print(result)