백준 5585번: 거스름돈 파이썬 풀이 (BOJ 5585)¶
link: https://www.acmicpc.net/problem/5585¶
In [6]:
change = 1000 - int(input())
yen = [500, 100, 50, 10, 5, 1]
cnt = 0
for y in yen:
if change < y:
continue
cnt = cnt + change//y
change %= y
print(change, cnt)
0 9
In [ ]:
'Algorithm' 카테고리의 다른 글
[LeetCode] #2 Longest Substring Without Repeating Characters (0) | 2021.07.31 |
---|---|
[LeetCode] #1 Increasing Triplet Subsequence (0) | 2021.07.31 |
댓글