19 December 2017

UVA 11614 Python solution

import math
n = int(input())
i=1
while i<=n:
x = int(input())
d = (-1 + math.sqrt(1 + 8 * x)) / 2
print(int(d))
i = i+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...
  • 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...
  • My first code with class in c++
    /*** Md. Namzul Hasan Shahjalal University of Science & Technology,Sylhet. hasan08sust@gmail.com ***/ #include<bits/stdc++.h...