반응형
https://www.acmicpc.net/problem/2480
# @Author YoungMinKim
# baekjoon
x= list(map(int,input().split()))
if len(set(x)) == 1:
print(10000+x[0]*1000)
elif len(set(x)) == 2:
if x.count(x[0]) == 2:
print(1000+x[0]*100)
elif x.count(x[1]) == 2:
print(1000 + x[1]*100)
else:
print(max(x)*100)
반응형
'백준 문제풀이' 카테고리의 다른 글
baekjoon - python - 2525 (0) | 2020.08.24 |
---|---|
baekjoon - python - 2523 (0) | 2020.08.24 |
baekjoon - python - 2446 (0) | 2020.08.24 |
baekjoon - python - 2441 (0) | 2020.08.24 |
baekjoon - python - 2440 (0) | 2020.08.24 |
댓글