728x90
9699번: RICE SACK
For each test case, the output contains a line in the format Case #x: followed by a sequence of integers, where x is the case number (starting from 1) and an integer that indicates the weight of a rice sack that will go to Al-Ameen.
www.acmicpc.net
문제 풀이
각 케이스마다 최댓값을 출력한다.
정답 코드
for i in range(1, int(input()) + 1) :
print("Case #{:d}: {:d}".format(i, max([*map(int, input().split())])))728x90
'Algorithm > PS' 카테고리의 다른 글
| [BOJ/백준] 9723 - Right Triangle [python] (0) | 2023.03.27 |
|---|---|
| [BOJ/백준] 9713 - Sum of Odd Sequence [python] (0) | 2023.03.27 |
| [BOJ/백준] 9698 - SAHUR & IMSA’ [python] (0) | 2023.03.27 |
| [BOJ/백준] 9635 - Balloons Colors [python] (0) | 2023.03.26 |
| [BOJ/백준] 9622 - Cabin Baggage [python] (0) | 2023.03.26 |
