BETA
Cosmic Number
Submissions: 532   Accuracy:

27.08%

  Difficulty: Easy
         

Given a single integer N, your task is to find the smallest number such that the sum of its digits is N and it is divisible by 10N.

Examples:

Input : N = 5
Output : 500000
500000 is the smallest number divisible
by 10^5 and sum of digits as 5.

Input : N = 20
Output : 29900000000000000000000

Input:
First line of the input contains an single integer T, denoting the number of test cases. Then T test cases follows. The only line of each test case contains a single integer N.

Output:
For each test case output the required answer on a new line.

Constraints:
1<=T<=50
0<=N<=100

Example:
Input:

2
6
19
Output:
6000000
1990000000000000000000

 

** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Harshit Sidhwa
Author: harshitsidhwa


Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.