948 - Fibonaccimal Base

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

int main()
{
	int fib[39] = { 0 };
	fib[0] = 1;
	fib[1] = 2;
	for (int i = 2; i < 39; i++) {
		fib[i] = fib[i - 1] + fib[i - 2];
	}
	int t;
	cin >> t;
	int number;
	for (int i = 0; i < t; i++) {
		cin >> number;
		cout << number << " = ";
		int flag = 0;
		for (int j = 38; j >= 0; j--) {
			if (number / fib[j] == 1) {
				cout << "1"; //output "1"
				number %= fib[j];
				flag = 1; //有了“1“之後才可以output "0"
			}
			else if (flag == 1) {  //輸入了1之後如果沒有 number/fib[i]的情況就一直跑0.
				cout << "0";
			}
		}
		cout << " (fib)" << endl;
	}
}