light oj 1105 规律

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <queue>
#define ll long long

using namespace std;
const int N = 1e5+1000;
int fib[50];
void init()
{

    fib[0]= fib[1] = 1;
    for(int i = 2; i <= 45; i++)
        fib[i] = fib[i-1]+fib[i-2];
}

void solve()
{
    int n;
    init();
    scanf("%d",&n);
    int l = 45;
    while(fib[l] > n) l--;

    for(int i = l; i >= 1; i--)
    {
        if(fib[i] <= n)
        {
            n -= fib[i];
            printf("1");
        }
        else
            printf("0");
    }
    printf("\n");
}

int main(void)
{
    int t,cnt = 0;
    scanf("%d",&t);

    while(t--)
    {
        printf("Case %d: ",++cnt);
        solve();
    }
    return 0;
}