C 解法, 执行用时: 2ms, 内存消耗: 292KB, 提交时间: 2021-09-17

#include <stdio.h>

int main() {

    int n;
    int bigNum = 1;
    int smallNum = 0;
    int firstNum = 0;
    int secondeNum = 1;
    scanf("%d", &n);
    
    while(firstNum+secondeNum < n){
        smallNum = firstNum + secondeNum;
        firstNum = secondeNum;
        secondeNum = smallNum;
    }
    bigNum = firstNum + secondeNum;
    if (n-smallNum > bigNum-n) {
        printf("%d", bigNum-n);
    } else {
        printf("%d", n-smallNum);
    }

}

C 解法, 执行用时: 2ms, 内存消耗: 308KB, 提交时间: 2022-04-13

#include<stdio.h>
int main()
{
    int a=0;
    int b=1;
    int c=0;
    int n;
    scanf("%d",&n);
    while(1)
    {
        if(n==c)
        {
            printf("%d",0);
            break;
        }
        if(n<=b)
        {
        if(abs(a-n)<abs(b-n))
        {
            printf("%d",abs(a-n));
            break;
        }
            else
            {
                printf("%d",abs(b-n));
                break;
            }
        }
        a=b;
        b=c;
        c=a+b;
    }
    return 0;
}