https://www.acmicpc.net/problem/13580
1
2
3
4
5
6
7
8
9
10
11
|
def sol(nums):
nums.sort()
if max(nums) == sum(nums) - max(nums):
return 'S'
elif nums[1] == nums[2] or nums[0] == nums[1]:
return 'S'
return 'N'
if __name__ == '__main__':
nums = list(map(int, input().split()))
print(sol(nums))
|
cs |
반응형
'python-algorithm' 카테고리의 다른 글
백준 21354 Äpplen och päron (0) | 2022.12.21 |
---|---|
백준 21633 Bank Transfer (0) | 2022.12.21 |
백준 21335 Another Eruption (0) | 2022.12.21 |
백준 20215 Cutting Corners (0) | 2022.12.21 |
백준 18409 母音を数える (Counting Vowels) (0) | 2022.12.21 |
댓글