06 December 2017

UVA 11727 Cost Cutting

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
at

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)

UVA 10679 - I Love Strings!!

  • Find out divisors of a number with a efficient way
    Suppose you have 24 and you need to find out all divisors of the number. The normally what we do? We just divide the number from 1 to 24. T...
  • Python Basic Gui
    #To make a simple gui follow the instructions. You need to at first install PyQt4 in your system. If you use linux run the code sudo apt-ge...
  • uva 10165
    It will be easy to solve the problem if you know about the Nim game. " Nim has been mathematically  solved  for any number of initial...