light oj 1105 规律

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

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

     fib[]= fib[] = ;
     for(int i = ; i <= ; i++)
         fib[i] = fib[i-]+fib[i-];
 }

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

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

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

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