【題解】CPE 一顆星選集：26. Fibonaccimal Base

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;

int main(){
    int T, n, backup, a, b, temp;
    cin >> T;
    while(T--){
        cin >> n;
        backup = n;
        vector<int> v;
        while(n > 0){
            a = 0, b = 1;
            while(b <= n){
                temp = a;
                a = b;
                b = temp + b;
            }
            v.push_back(a);
            n -= a;
        }
        string s = "";
        a = 0, b = 1;
        while(!v.empty()){
            temp = a;
            a = b;
            b = temp + b;
            if(v.back() == b){
                s += "1";
                v.pop_back();
            }else{
                s += "0";
            }
        }
        reverse(s.begin(), s.end());
        cout << backup << " = " << s << " (fib)\n";
    }
}