Digital Square
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1827 Accepted Submission(s): 714
Problem Description Given an integer N,you should come up with the minimum
nonnegative integer M.M meets the follow condition: M
2%10
x=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 <=10
9), indicating the given number.
Output For each case output the answer if it exists, otherwise print “None”.
Sample Input
3
3
21
25
Sample Output
None
11
5
Source 2012 Multi-University Training Contest 10
題意:求最小的M滿足M
2%10
x=N (x=0,1,2,3....)。 分析:從N的個位開始,一位一位的往上搜;即先個位,再十位,百位·····。
#include
#include
#include
#include
#include
#include