📌문제
🎖️난이도
✔️풀이
seed = int(input())
juga_list = list(map(int, input().split()))
# junhyun
bnp = seed
num = 0
for juga in juga_list:
if bnp == 0:
break
buy = bnp // juga
num += buy
bnp -= juga * buy
bnp_result = bnp + num * juga_list[-1]
# sungmin
timing = seed
num = 0
for i in range(len(juga_list)-3):
if juga_list[i] < juga_list[i+1] < juga_list[i+2] < juga_list[i+3] and num!=0:
sell = num
num = 0
timing += juga_list[i+3] * sell
if juga_list[i] > juga_list[i+1] > juga_list[i+2] > juga_list[i+3]:
buy = timing // juga_list[i+3]
num += buy
timing -= juga_list[i+3] * buy
timing_result = timing + num * juga_list[-1]
# print result
if bnp_result > timing_result:
print("BNP")
elif bnp_result < timing_result:
print("TIMING")
else:
print("SAMESAME")
🧠노트
핵심 코드 : if juga_list[i] < juga_list[i+1] < juga_list[i+2] < juga_list[i+3] and num!=0:
🔍참고
-
'[ 알고리즘 ] > Implementation' 카테고리의 다른 글
[백준] 12933. 오리 (0) | 2022.08.02 |
---|---|
[백준] 20918. 전구 (0) | 2022.08.01 |
[백준] 2443. 별 찍기 - 6 (0) | 2022.06.30 |
[백준] 2442. 별 찍기 - 5 (0) | 2022.06.30 |
[백준] 2441. 별 찍기 - 4 (0) | 2022.06.30 |