Desert
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 300 Accepted Submission(s): 206
Problem Description
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.
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\leq10)$.
Next $T$ lines contain the number $n(1\leq n\leq1000000)$ for each test case.
Next $T$ lines contain the number $n(1\leq n\leq1000000)$ 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.
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
Source
"巴卡斯杯" 中国大学生程序设计竞赛 - 女生专场
Hint
3 liters of water can be comsumed in four different ways show in the following.
1. 1 1 1
2. 1 2
3. 2 1
4. 3
If we write 4 in binary, it's 100.