| 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)
-
/* ** Md. Nazmul Hasan Shahjalal University of Science & Technology,Sylhet. hasan08sust@gmail.com ** */ # include < iostream ...
-
Problem Explanation Category: Easy One have to find out maximum number of player which is even. Check the amount of left hand player...
-
Let explain one input. a = -202202202202202202 and b =-101.Make partition of a such that the partition is divisible by b. Look 202 is divi...
No comments:
Post a Comment