# hdu 5703 Desert（找规律）

2016-07-01 09:43:40         来源：若忆_star

Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)

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.

Input The first line contains the number of test casesT(T≤10).
NextTlines contain the numbern(1≤n≤1000000)for each test case.

Output Output consists ofTlines.
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

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.```

Source "巴卡斯杯" 中国大学生程序设计竞赛 - 女生专场

```#include <iostream>
#include <cstdio>
#include <cmath>

using namespace std;

int main()
{
int t;
scanf("%d",&t);
while (t--)
{
int n;
scanf("%d",&n);
printf ("1");
for (int i=0;i<n-1;i++)
printf ("0");
printf ("\n");
}
return 0;
}```