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)T(T≤10). Next TT lines contain the number n(1≤n≤1000000)n(1≤n≤1000000) for each test case. Output Output consists of TT 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 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.
题意：
一开始有数量为n（1<=n<=1e6）升的水， 我们每天可以喝数量为任意整数的水，问你有多少种方式可以把水喝完。
思路：
一开始将重心放在了寻找前后有多少方式的关系，耗了不少时间，其实只要将数改成二进制，即可发现规律！！！
代码：
#include <bits/stdc++.h>
using namespace std;
int main()
{
int t;
int n;
cin>>t;
while(t--)
{
cin>>n;
cout<<"1";
for(int i=0;i<n-1;i++)
{
cout<<"0";
}
cout<<endl;
}
return 0;
}
