题解 | Fibonacci数列

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

const int N = 1000000;

int main() 
{
    int n;
    cin >> n;
    vector<int> Fibonacci{1, 2};
    while(Fibonacci.back() < 2 * N)
    {
        int next = Fibonacci[Fibonacci.size() - 1] + Fibonacci[Fibonacci.size() - 2];
        Fibonacci.push_back(next);
    }

    for(int i = 0; i < n; i++)
    {
        if(Fibonacci[i] >= n)
        {
            int diff1 = Fibonacci[i] - n;
            int diff2 = n - Fibonacci[i - 1];
            cout << min(diff1, diff2) << endl;
            break;
        }
    }

    return 0;

}