"巴卡斯杯" 中国大学生程序设计竞赛 - 女生专场（重现） HDU 5703

Desert

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

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

  
  

   
   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

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

 

Recommend

liuyiding   |   We have carefully selected several similar problems for you:   5711  5710  5709  5708  5700 

 

水题。显然答案是2^n 二进制就是1个1，n-1个0.

#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstdio>
using namespace std;
//void printf(int begin,int end,int mid)
//{
//    int i;
//    if(begin>end)
//        return;
//    for(i=begin; i<=end; i++)
//        if(b[i]==a[mid])
//            break;
//    printf(begin,i-1,mid+1);  //中序，先左，后跟，再右。此时i为跟节点，左子树必定在begin到i-1里面。
//    printf(i+1,end,mid-begin+i+1);//中序，先左，后跟，再右。此时i为跟节点，右子树必定在i+1到end里面。
//    cout<<a[mid];
//    if(mid==1)
//        cout<<endl;
//    else
//        cout<<" ";
//}
struct node
{
    int id;
    char s[1000];
};
bool cmp(node a,node b)
{
    return a.id>b.id;
}
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        int n;
        cin>>n;
        cout<<"1";
        n--;
        while(n--)
            cout<<0;
        cout<<endl;
    }
}