Skip to content

Commit 6ab89fb

Browse files
YoonYn9915YoonYn9915
committed
weekly challenges 파일 이름 주차 수정
1 parent 3800741 commit 6ab89fb

12 files changed

+61
-61
lines changed

_WeeklyChallenges/W15-[DP]/Assignment_BOJ_2281_데스노트.py renamed to _WeeklyChallenges/W14-[DP]/Assignment_BOJ_2281_데스노트.py

File renamed without changes.

‎_WeeklyChallenges/W14-[DP]/README.md‎

Lines changed: 9 additions & 10 deletions
Original file line numberDiff line numberDiff line change
@@ -1,17 +1,16 @@
1-
## 🚀3월 3주차 (3/22) 스터디 발제 주제: DP
2-
> 발제자: 조윤상 (@YoonYn9915)
1+
## 🚀3월 2주차 (3/10) 스터디 발제 주제: Dynamic programming
2+
> 발제자: 김홍주
33
4-
> 주제: DP
4+
> 주제: Dynamic programming
55
### 🗂️ 스터디 자료
66
- PDF: [바로가기
7-
](./Study_BOJ_2293.pdf)
8-
9-
### 📖 문제
10-
- [백준 #2293. 동전 1](https://www.acmicpc.net/problem/2293): DP / 골드 4
11-
- 정답 코드: [Study_BOJ_2293_동전 1.py](https://github.com/AlgorithmStudy-Allumbus/codingtest_algorithm_study/blob/fad656cae819a42bc7b82c541388bcf249df9604/_WeeklyChallenges/W14-%5BDP%5D/Assignment_BOJ_2294_%EB%8F%99%EC%A0%84%202.py)
7+
](./Study_BOJ_2294.pdf)
128

139

10+
### 📖 문제
11+
- [백준 #2342. Dance Dance Revolution](https://www.acmicpc.net/problem/2342): Dynamic Programming / 골드3
12+
- 정답 코드: [Study_BOJ_2342_DanceDanceRevolution.py](./Study_BOJ_2342_DanceDanceRevolution)
1413

1514
### 💻 과제
16-
- [백준 #2294. 동전 2](https://www.acmicpc.net/problem/2294): DP / 골드 5
17-
- 정답 코드: [Study_BOJ_2294_동전 2.py](https://github.com/AlgorithmStudy-Allumbus/codingtest_algorithm_study/blob/fad656cae819a42bc7b82c541388bcf249df9604/_WeeklyChallenges/W14-%5BDP%5D/Assignment_BOJ_2294_%EB%8F%99%EC%A0%84%202.py)
15+
- [백준 #2281. 데스노트](https://www.acmicpc.net/problem/2281): Dynamic Programming / 골드4
16+
- 정답 코드: [Assignment_BOJ_2281_데스노트.py](./Assignment_BOJ_2281_데스노트.py)

_WeeklyChallenges/W15-[DP]/Study_BOJ_2342.pdf renamed to _WeeklyChallenges/W14-[DP]/Study_BOJ_2342.pdf

File renamed without changes.

_WeeklyChallenges/W15-[DP]/Study_BOJ_2342_DanceDanceRevolution.py renamed to _WeeklyChallenges/W14-[DP]/Study_BOJ_2342_DanceDanceRevolution.py

File renamed without changes.

_WeeklyChallenges/W14-[DP]/Assignment_BOJ_2294_동전 2.py renamed to _WeeklyChallenges/W15-[DP]/Assignment_BOJ_2294_동전 2.py

Lines changed: 20 additions & 20 deletions
Original file line numberDiff line numberDiff line change
@@ -1,21 +1,21 @@
1-
'''
2-
BOJ #2294. 동전 2 (골드 5)
3-
https://www.acmicpc.net/problem/2294
4-
유형: DP
5-
'''
6-
7-
8-
for _ in range(n):
9-
arr.append(int(input()))
10-
11-
dp = [100001 for i in range(k + 1)]
12-
dp[0] = 0
13-
14-
for coin in arr:
15-
for i in range(coin, k + 1):
16-
dp[i] = min(dp[i], dp[i - coin] + 1)
17-
18-
if dp[k] == 100001:
19-
print(-1)
20-
else:
1+
'''
2+
BOJ #2294. 동전 2 (골드 5)
3+
https://www.acmicpc.net/problem/2294
4+
유형: DP
5+
'''
6+
7+
8+
for _ in range(n):
9+
arr.append(int(input()))
10+
11+
dp = [100001 for i in range(k + 1)]
12+
dp[0] = 0
13+
14+
for coin in arr:
15+
for i in range(coin, k + 1):
16+
dp[i] = min(dp[i], dp[i - coin] + 1)
17+
18+
if dp[k] == 100001:
19+
print(-1)
20+
else:
2121
print(dp[k])

‎_WeeklyChallenges/W15-[DP]/README.md‎

Lines changed: 10 additions & 9 deletions
Original file line numberDiff line numberDiff line change
@@ -1,16 +1,17 @@
1-
## 🚀3월 2주차 (3/10) 스터디 발제 주제: Dynamic programming
2-
> 발제자: 김홍주
1+
## 🚀3월 3주차 (3/22) 스터디 발제 주제: DP
2+
> 발제자: 조윤상 (@YoonYn9915)
33
4-
> 주제: Dynamic programming
4+
> 주제: DP
55
### 🗂️ 스터디 자료
66
- PDF: [바로가기
7-
](./Study_BOJ_2294.pdf)
8-
7+
](./Study_BOJ_2293.pdf)
98

109
### 📖 문제
11-
- [백준 #2342. Dance Dance Revolution](https://www.acmicpc.net/problem/2342): Dynamic Programming / 골드3
12-
- 정답 코드: [Study_BOJ_2342_DanceDanceRevolution.py](./Study_BOJ_2342_DanceDanceRevolution)
10+
- [백준 #2293. 동전 1](https://www.acmicpc.net/problem/2293): DP / 골드 4
11+
- 정답 코드: [Study_BOJ_2293_동전 1.py](https://github.com/AlgorithmStudy-Allumbus/codingtest_algorithm_study/blob/fad656cae819a42bc7b82c541388bcf249df9604/_WeeklyChallenges/W14-%5BDP%5D/Assignment_BOJ_2294_%EB%8F%99%EC%A0%84%202.py)
12+
13+
1314

1415
### 💻 과제
15-
- [백준 #2281. 데스노트](https://www.acmicpc.net/problem/2281): Dynamic Programming / 골드4
16-
- 정답 코드: [Assignment_BOJ_2281_데스노트.py](./Assignment_BOJ_2281_데스노트.py)
16+
- [백준 #2294. 동전 2](https://www.acmicpc.net/problem/2294): DP / 골드 5
17+
- 정답 코드: [Study_BOJ_2294_동전 2.py](https://github.com/AlgorithmStudy-Allumbus/codingtest_algorithm_study/blob/fad656cae819a42bc7b82c541388bcf249df9604/_WeeklyChallenges/W14-%5BDP%5D/Assignment_BOJ_2294_%EB%8F%99%EC%A0%84%202.py)

_WeeklyChallenges/W14-[DP]/Study_BOJ_2293.pdf renamed to _WeeklyChallenges/W15-[DP]/Study_BOJ_2293.pdf

File renamed without changes.

_WeeklyChallenges/W14-[DP]/Study_BOJ_2293_동전 1.py renamed to _WeeklyChallenges/W15-[DP]/Study_BOJ_2293_동전 1.py

Lines changed: 22 additions & 22 deletions
Original file line numberDiff line numberDiff line change
@@ -1,22 +1,22 @@
1-
'''
2-
BOJ #2293. 동전 1 (골드4)
3-
https://www.acmicpc.net/problem/2293
4-
유형: DP
5-
'''
6-
7-
n, k = map(int, input().split())
8-
9-
coin = []
10-
dp = [0] * (k + 1)
11-
12-
for _ in range(n):
13-
coin.append(int(input()))
14-
15-
coin.sort()
16-
dp[0] = 1
17-
18-
for c in coin:
19-
for i in range(c, k+1):
20-
dp[i] += dp[i-c]
21-
22-
print(dp[k])
1+
'''
2+
BOJ #2293. 동전 1 (골드4)
3+
https://www.acmicpc.net/problem/2293
4+
유형: DP
5+
'''
6+
7+
n, k = map(int, input().split())
8+
9+
coin = []
10+
dp = [0] * (k + 1)
11+
12+
for _ in range(n):
13+
coin.append(int(input()))
14+
15+
coin.sort()
16+
dp[0] = 1
17+
18+
for c in coin:
19+
for i in range(c, k+1):
20+
dp[i] += dp[i-c]
21+
22+
print(dp[k])

_WeeklyChallenges/W15-[DFS/BFS]/Assignment_BOJ_4963_섬의개수.py renamed to _WeeklyChallenges/W16-[DFS + BFS]/BFS]/Assignment_BOJ_4963_섬의개수.py

File renamed without changes.

_WeeklyChallenges/W15-[DFS/BFS]/README.md renamed to _WeeklyChallenges/W16-[DFS + BFS]/BFS]/README.md

File renamed without changes.

0 commit comments

Comments
 (0)