![]() |
||||||||||
|
||||||||||
Digital SquareTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2861 Accepted Submission(s): 1182 Problem Description Given an integer N,you should come up with the minimum nonnegative integer M.M meets the follow condition: M2%10x=N (x=0,1,2,3....) Input The first line has an integer T( T< = 1000), the number of test cases. For each case, each line contains one integer N(0<= N <=109), indicating the given number. Output For each case output the answer if it exists, otherwise print “None”. Sample Input
Sample Output
Source | ||||||||||
|