#include <iostream>
#include <vector>
#include <algorithm>    // find()
#include <numeric>      // accumulate()

#define DEBUG 1

using namespace std;

const int rangeMin = 20;
const int rangeMax = 100;

vector<int> generateBinaryVector(int n);
vector<int> generateFibVector();

int main() {
    vector<int> fibVector = generateFibVector();

    #if DEBUG
    cout << "Wygenerowano tablice ciagu Fibonacciego: {";
    for (vector<int>::iterator it = fibVector.begin(); it != fibVector.end(); ++it) {
        cout << *it << ", ";
    }
    cout << "\b\b}" << endl << endl;
    #endif

    for (int i=rangeMin; i<=rangeMax; i++) {
        vector<int> binVector = generateBinaryVector(i);
        int sum = accumulate(binVector.begin(), binVector.end(), 0);

        #if DEBUG
        cout << "Sprawdzana liczba: " << i << " (postac binarna: ";
        for (vector<int>::iterator it = binVector.begin(); it != binVector.end(); ++it) {
            cout << *it;
        }
        cout << "; suma: " << sum << ")... ";
        #endif

        if (find(fibVector.begin(), fibVector.end(), sum) != fibVector.end()) {
            #if DEBUG
            cout << "pasuje!" << endl;
            #else
            cout << i << endl;
            #endif
        }
        #if DEBUG
        else {
            cout << "nie pasuje" << endl;
        }
        #endif
    }

    return 0;
}

vector<int> generateFibVector() {
    int digitCount = generateBinaryVector(rangeMax).size(); //maksymalna mozliwa suma
    int currentValue;
    vector<int> fibVector;

    fibVector.push_back(0);
    fibVector.push_back(1);
    fibVector.push_back(1);

    while (true) {
        currentValue = fibVector.back() + fibVector.end()[-2];

        if (currentValue > digitCount) {
            break;
        }
        else {
            fibVector.push_back(currentValue);
        }
    }

    return fibVector;
}

vector<int> generateBinaryVector(int n) {
    vector<int> binaryValue;

    for (int i=0;n>0;i++) {
        binaryValue.insert(binaryValue.begin(), n%2);
        n/=2;
    }

    return binaryValue;
}