91 - ZOJ Monthly, May 2010 - C
Given a positive integer x, let S(x) denotes the sum of all x's digits. Two integers x and y are friend numbers if S(x)=S(y). Here comes the problem: Given a positive integer x, of course it has a lot of friend numbers, find the smallest one which is greater than x,please.
There are multiple test cases. The first line of input is an integer T (0<T<230) indicating the number of test cases. Then T test cases follow. Each case is an integer x (0<x<=101000).
For each test case, output the result integer in a single line.
3 12 19 222
21 28 231
Note: No input data start with digit 0 and you should not output a number starts with 0.