Status:  Past  Start:  20111201 14:00:00  End:  20111201 19:10:00 
The Caribbean Training Contest #29
Problem
1635  Sum of Digits I
Created by  Timus Online Judge  Leonid Volkov 
Added by  ymondelo20 (20111126) 
Limits 
Total Time: 2000 MS
Memory: 62 MB  Output: 64 MB  Size:
29 KB

Enabled languages  
Available in 
Description
Petka thought of a positive integer n and reported to Chapaev the sum of its digits and the sum of its squared digits. Chapaev scratched his head and said: "Well, Petka, I won't find just your number, but I can find the smallest fitting number." Can you do the same?
Petka thought of a positive integer n and reported to Chapaev the sum of its digits and the sum of its squared digits. Chapaev scratched his head and said: "Well, Petka, I won't find just your number, but I can find the smallest fitting number." Can you do the same?
Petka thought of a positive integer n and reported to Chapaev the sum of its digits and the sum of its squared digits. Chapaev scratched his head and said: "Well, Petka, I won't find just your number, but I can find the smallest fitting number." Can you do the same?
Input specification
The first line contains the number of test cases t (no more than 10000). In each of the following t lines there are numbers s1 and s2 (1 <= s1, s2 <= 10000) separated by a space. They are the sum of digits and the sum of squared digits of the number n.
The first line contains the number of test cases t (no more than 10000). In each of the following t lines there are numbers s1 and s2 (1 <= s1, s2 <= 10000) separated by a space. They are the sum of digits and the sum of squared digits of the number n.
The first line contains the number of test cases t (no more than 10000). In each of the following t lines there are numbers s1 and s2 (1 <= s1, s2 <= 10000) separated by a space. They are the sum of digits and the sum of squared digits of the number n.
Output specification
For each test case, output in a separate line the smallest fitting number n, or "No solution" if there is no such number or if it contains more than 100 digits.
For each test case, output in a separate line the smallest fitting number n, or "No solution" if there is no such number or if it contains more than 100 digits.
The first line contains the number of test cases t (no more than 10000). In each of the following t lines there are numbers s1 and s2 (1 <= s1, s2 <= 10000) separated by a space. They are the sum of digits and the sum of squared digits of the number n.
Sample input
4
9 81
12 9
6 10
7 9
Sample output
9
No solution
1122
111112
Hint(s)
http://coj.uci.cu/contest/
http://coj.uci.cu/contest/
http://coj.uci.cu/contest/