| 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: Easy Algorithm : Binary search Explanation: You are given a list of numbers which represent mone...
-
#include<cstring> #include<iostream> #include<queue> #include<cstdio> using namespace std; const int Maxn = 10...
-
/*** Md. Namzul Hasan Shahjalal University of Science & Technology,Sylhet. hasan08sust@gmail.com ***/ #include<bits/stdc++.h...
No comments:
Post a Comment