uva 11089

費式數列特性

//============================================================================
// Name        : Fi-binary Number.cpp
// Date : 2013/4/30 上午10:08:18
// Author : GCA
//============================================================================
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
using namespace std;
#ifdef ONLINE_JUDGE
#define ll "%lld"
#else
#define ll "%I64d"
#endif
typedef unsigned int uint;
typedef long long int Int;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\n")
#define I_de(x,n)for(int i=0;i<n;i++)printf("%d ",x[i]);Pln()
#define De(x)printf(#x"%d\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\
    printf("%d ",dp[htx][hty]);}Pln();}
#define MM 100

#define PII pair<int,int>
#define PB push_back
#define oo INT_MAX
#define Set_oo 0x3f
#define Is_debug true
#define debug(...) if(Is_debug)printf("DEBUG: "),printf(__VA_ARGS__)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define eps 1e-6
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
    int tmp=min(x,y);
    return min(tmp,z);
}
int max3(int x,int y,int z){
    int tmp=max(x,y);
    return max(tmp,z);
}
int M;
int f[100];
void pre(){
    M=100;

    f[0]=1;
    f[1]=2;
    for(int i=2;i<M;i++){
        f[i]=f[i-1]+f[i-2];
        if(f[i]<0)M=i-1;
        //printf("%d ",f[i]);
    }//Pln();
}
int ans[100];
int n;
int main() {
    ios_base::sync_with_stdio(0);
    int test;
    pre();
    scanf("%d",&test);
    while(test--){
        int fg=0;
        scanf("%d",&n);
        for(int i=M-1;i>=0;i--){
            if(n>=f[i]){
                n-=f[i];
                fg=1;
                printf("1");
            }
            else if(fg){
                printf("0");
            }
        }
        Pln();
    }



}