hdu 5703 Desert 水题

Desert

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)
Total Submission(s): 1240    Accepted Submission(s): 876

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

13

 

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.
1 ：
2 ：1 1
2
3： 1 1 1
2 1
1 2
3
4：
1 1 1 1
2 1 1
1 2 1
1 1 2
2 2
3 1
1 3
4
看规律。。。
#include <bits/stdc++.h>using namespace std;int t, n;int main(){    scanf("%d", &t);    while(t--){        scanf("%d", &n);        printf("1");        for(int i = 0; i < n-1; i++){            printf("0");        }        printf("\n");    }}