A tourist gets lost in the desert with n liters of water. He drinks positive integer units of water each day.
Write a program to calculate how many different ways the tourist can drink up the water.
Input
The first line contains the number of test cases T(T≤10).
Next T lines contain the number n(1≤n≤1000000) for each test case.
Output
Output consists of T lines.
Each line contains the binary number which represents number of different ways to finish up the water specified in the test case.
Sample Input
1
3
Sample Output
100
#include"stdio.h"
int main()
{
int t,x;
scanf("%d",&t);
while (t--)
{
scanf("%d",&x);
printf ("1");
for (int i=0;i<x-1;i++)
printf ("0");
printf ("\n");
}
return 0;
}
Hint
3 liters of water can be comsumed in four different ways show in the following.
- 1 1 1
- 1 2
- 2 1
- 3
If we write 4 in binary(二进制), it’s 100.