Psuedobinary Numbers
Submissions: 135   Accuracy:

36.29%

  Difficulty: Easy   Marks: 2

You are given a number - N, you have to represent this number as sum of minimum number of possible psuedobinary numbers. A number is said to be psuedobinary number if its decimal number consists of only two digits (0 and 1)

Examples:

Input       : 31
Output      : 11 10 10
Explanation : 31 can be represented as sum of
              minimum 3 psuedobinary numbers as 11+10+10 

Example : 
Input : 

The first line of input contains an integer T denoting the Test cases. Then T test cases follow. 
Second line contains number - N

Output : 
N as sum of minimum number of possible psuedobinary numbers

Constraints :
1 ≤ T ≤ 50
1 ≤ N ≤ 10^6

Input : 
2
44
100

Output : 
11 11 11 11
100

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

Contributor: Mohit Gupta_OMG :)
Author: Mohit Gupta 4


If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.



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


to report an issue on this page.