Sum Of Fibonacci Numbers

• Time : $O(fibo(A))$
• Space : $O(fibo(A))$

int Solution::fibsum(int A) {
    vector<int> fibo{1,1};
    while(fibo.back() < A) fibo.push_back(fibo[fibo.size() - 1] + fibo[fibo.size() - 2]);
    int res = 0;
    while(A and fibo.size()) {
        if(fibo.back() <= A) {
            A -= fibo.back();
            res += 1;
        }
        fibo.pop_back();
    }
    return res;
}