Heron and His TriangleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others) Total Submission(s): 349 Accepted Submission(s): 64
Problem Description A triangle is a Heron¡¯s triangle if it satisfies that the side lengths of it are consecutive integers t−1, t, t+ 1 and thatits area is an integer. Now, for given n you need to find a Heron¡¯s triangle associated with the smallest t bigger than or equal to n.
Input The input contains multiple test cases. The first line of a multiple input is an integer T (1 ¡Ü T ¡Ü 30000) followedby T lines. Each line contains an integer N (1 ¡Ü N ¡Ü 10^30).
Output For each test case, output the smallest t in a line. If the Heron¡¯s triangle required does not exist, output -1.
Sample Input
Sample Output Statistic | Submit | Clarifications | Back
|