Merge branch 'main' into origin/16-2secondag

2secondag/README.md

@@ -12,12 +12,7 @@
 | 8차시 | 2024.01.22 |  구현  | [단어 공부] (https://www.acmicpc.net/problem/1157) | [#31](https://github.com/AlgoLeadMe/AlgoLeadMe-5/pull/31#event-11604202172)|
 | 9차시 | 2024.01.25 |  수학  | [달팽이는 올라가고 싶다] (https://www.acmicpc.net/problem/2869) | [#37](https://github.com/AlgoLeadMe/AlgoLeadMe-5/pull/37#event-11619409875)|
 | 10차시 | 2024.01.28 |  구현  | [음계] (https://www.acmicpc.net/problem/2920) | [#39](https://github.com/AlgoLeadMe/AlgoLeadMe-5/pull/39#event-11655882785)|
-<<<<<<< Updated upstream
-=======
 | 11차시 | 2024.01.31 |  부루트포스 알고리즘  | [블랙잭] (https://www.acmicpc.net/problem/2798) | [#46]()|
 | 12차시 | 2024.02.15 |  스택  | [스택] (https://www.acmicpc.net/problem/10828) | [#58](https://github.com/AlgoLeadMe/AlgoLeadMe-5/pull/58)|
 | 13차시 | 2024.02.18 |  브루트포스  | [체스판 다시 칠하기] (https://www.acmicpc.net/problem/1018) | [#62](https://github.com/AlgoLeadMe/AlgoLeadMe-5/pull/62)|
 | 14차시 | 2024.02.21 |  자료구조  | [수 찾기] (https://www.acmicpc.net/problem/1920) | [#63](https://github.com/AlgoLeadMe/AlgoLeadMe-5/pull/63#issuecomment-1962366605)|
-| 15차시 | 2024.02.24 |  구현  | [요세푸스 문제] (https://www.acmicpc.net/problem/11866) | [#65](https://github.com/AlgoLeadMe/AlgoLeadMe-5/pull/65)|
->>>>>>> Stashed changes
-

2secondag/자료구조/요세푸스 문제.py

@@ -0,0 +1,17 @@
+import sys
+
+N, K = map(int, sys.stdin.readline().split())
+people = []
+
+for i in range(1,N+1):
+  people.append(i)
+
+result = []
+
+
+index = 0
+for i in range(1, N + 1):
+    index = (index + K - 1) % len(people)
+    result.append(people.pop(index))
+
+print("<" + ", ".join(map(str, result)) + ">")

bomik0221/DP/240224.cpp

@@ -0,0 +1,24 @@
+#include <iostream>
+#include <vector>
+
+int main() {
+	int N; std::cin >> N;
+	std::vector<int> game(N+1, 0);
+	game[1] = 1;	game[3] = 1;	//상근이는 1, 창영이는 2
+
+	for (int i = 2; i <= N; i++) {
+		if (game[i - 1] == 1) {
+			game[i] = 2;
+			if(i+2 <=N)	game[i + 2] = 2;
+		}
+		else {
+			game[i] = 1;
+			if (i + 2 <= N)	game[i + 2] = 1;
+		}
+	}
+
+	if (game[N] == 1)	std::cout << "SK";
+	else std::cout << "CY";
+
+	return 0;
+}

bomik0221/README.md

@@ -17,5 +17,6 @@
 | 13차시 | 2024.02.06 |  DFS  | [유기농 배추](https://www.acmicpc.net/problem/1012)  | [#51](https://github.com/AlgoLeadMe/AlgoLeadMe-5/pull/51) |
 | 14차시 | 2024.02.15 |  위상정렬  | [줄 세우기](https://www.acmicpc.net/problem/2252)  | [#57](https://github.com/AlgoLeadMe/AlgoLeadMe-5/pull/57) |
 | 15차시 | 2024.02.18 |  위상정렬  | [문제집](https://www.acmicpc.net/problem/1766)  | [#60](https://github.com/AlgoLeadMe/AlgoLeadMe-5/pull/60) |
+| 16차시 | 2024.02.24 |  DP  | [돌 게임](https://www.acmicpc.net/problem/9655)  | [#67](https://github.com/AlgoLeadMe/AlgoLeadMe-5/pull/67) |
 ---