| test = int(input()) | |
| n=1 | |
| #data_list = [] | |
| while n<=test: | |
| p =0 | |
| data_list = [int(x) for x in input().split()] | |
| data_list.sort() | |
| print("Case %d: %d"%(n,data_list[1])) | |
| n += 1 |
Subscribe to:
Post Comments (Atom)
-
Problem Explanation Problem Category : Medium Algorithm: Binary Search, Mathematical Simulation For this problem, if you know how to f...
-
Problem Explanation Category: Easy Type: String Ad Hoc This is simple string ad hoc problem. You just need to find out a substring of...
-
Explanation category : Easy You just need to sum up all numbers. If you find any negative number just make it positive. Source code l...
No comments:
Post a Comment