题解 | #斐波那契数列#

#include<stdio.h>

//输入n，输出第n个斐波那数
int Fibonacci_sequence(unsigned int m);

int main(int argc,const char* argv[])
{
    unsigned int n;
    scanf("%u",&n);
    printf("%u",Fibonacci_sequence(n));
    return 0;
}

int Fibonacci_sequence(unsigned int n)
{
    int a1 = 1;
    int a2 = 1;
    if(n == 1 || n == 2) return a1;
    else
    {
        for(int i=0;i<n-2;i++)
        {
            a1 += a2;
            a2 = a1 - a2;
        }
        return a1;
    }
}