编辑代码

#include <stdio.h>

// 非递归实现函数
int Fibonacci(const int n){
    if(n>2){
        int temp = 1;
        int prev = 1;
        int next = 1;
        for (int i=3;i<=n;i++){
            temp = prev + next;
            prev = next;
            next = temp;
        }
        return temp;
    }
    else{
        return 1;
    }
}

int Fibonacci_x(int n){
    if(n>2)
    return Fibonacci_x(n-1) + Fibonacci_x(n-2);
    else
    return 1;
}

int main () {
    int i = 0;
    scanf("%d",&i);
    printf("%d\n",Fibonacci(i));
    printf("%d",Fibonacci_x(i));
}