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!!

  • UVA 11228 - Transportation system.
    Click here to view the problem /*** Md. Namzul Hasan Shahjalal University of Science & Technology,Sylhet. hasan08sust@gmail.com **...
  • Binary GCD code
    There are many algorithm to find GCD of any two number. Here is an algorithm . For details visit  https://en.wikipedia.org/wiki/Binary_GCD_...
  • UVA 908 - Re-connecting Computer Sites
    Click here to view the problem /*** Md. Namzul Hasan Shahjalal University of Science & Technology,Sylhet. hasan08sust@gmail.com **...