题解 | #Fibonacci数列#

#include <stdio.h>
//不考虑负数
int fib(int x)
{
    if (x >=0 && x<2)
    {
        return x;
    }
    else  
    {
        return fib(x - 1) + fib(x - 2);
    }
}

int main()
{
    int n = 0;
    scanf("%d", &n);
    int x = 0;
    while (fib(x) <= n)
    {
        x++;
    }
    int min = 0;
    min = (fib(x) - n)>(n - fib(x - 1))? (n - fib(x - 1)): (fib(x) - n);
    printf("%d", min);

    return 0;
}