๐Ÿ—๏ธ Algorithm/๐ŸŸฉ ๋ฐฑ์ค€

[๋ฐฑ์ค€] (Python) 10162๋ฒˆ _์ „์ž๋ ˆ์ธ์ง€

Dbswnstjd 2022. 2. 17. 18:45

https://www.acmicpc.net/problem/10162

 

10162๋ฒˆ: ์ „์ž๋ ˆ์ธ์ง€

3๊ฐœ์˜ ์‹œ๊ฐ„์กฐ์ ˆ์šฉ ๋ฒ„ํŠผ A B C๊ฐ€ ๋‹ฌ๋ฆฐ ์ „์ž๋ ˆ์ธ์ง€๊ฐ€ ์žˆ๋‹ค. ๊ฐ ๋ฒ„ํŠผ๋งˆ๋‹ค ์ผ์ •ํ•œ ์‹œ๊ฐ„์ด ์ง€์ •๋˜์–ด ์žˆ์–ด ํ•ด๋‹น ๋ฒ„ํŠผ์„ ํ•œ๋ฒˆ ๋ˆ„๋ฅผ ๋•Œ๋งˆ๋‹ค ๊ทธ ์‹œ๊ฐ„์ด ๋™์ž‘์‹œ๊ฐ„์— ๋”ํ•ด์ง„๋‹ค. ๋ฒ„ํŠผ A, B, C์— ์ง€์ •๋œ ์‹œ๊ฐ„์€

www.acmicpc.net

ํ’€์ด

๊ทธ๋ฆฌ๋”” ์•Œ๊ณ ๋ฆฌ์ฆ˜

# ๋ฐฑ์ค€ 10162๋ฒˆ ๋ฌธ์ œ - ์ „์ž๋ ˆ์ธ์ง€
import sys
n = int(sys.stdin.readline().rstrip())

buttons = [300, 60, 10]
count = [0] * 3
if(n % 10 != 0):
    print(-1)
else:
    for i in range(3):
        count[i] = n // buttons[i]
        n = n % buttons[i]
    print(count[0], count[1], count[2])

 

1. ๊ฐ’์ด ๋‚˜๋ˆ„์–ด ๋–จ์–ด์ง€์ง€ ์•Š์„ ๊ฒฝ์šฐ -1์„ ์ถœ๋ ฅํ•ด์•ผ ํ•˜๋ฏ€๋กœ ๋จผ์ € ์˜ˆ์™ธ์ฒ˜๋ฆฌ 

--> 10์œผ๋กœ ๋‚˜๋ˆ„์—ˆ์„ ๋•Œ 1์˜ ์ž๋ฆฌ๊ฐ€ ๋‚˜๋ˆ„์–ด ๋–จ์–ด์ง€์ง€ ์•Š์„ ๊ฒฝ์šฐ -1 ์ถœ๋ ฅ

 

2. button์˜ ์ข…๋ฅ˜์— ๋”ฐ๋ผ ๋‚˜๋ˆ„์–ด์„œ ๋ช‡๋ฒˆ ๋ˆ„๋ฅด๊ฒŒ ๋˜๋Š”์ง€ count์— ์ €์žฅ

 

3. count ์ถœ๋ ฅ