#include<stdio.h>
long fib(size_t n)
{
if (n == 1 || n ==2)
{
return 1;
}
long f1 = 1;
long f2 = 1;
long f = 0;
for (int i=3;i<=n;i++)
{
f = f1+f2;
f1 = f2;
f2 = f;
}
return f;
}
int main()
{
printf("%d\n",fib(1)); //1
printf("%d\n",fib(2)); //1
printf("%d\n",fib(6)); //8
printf("%d\n",fib(7)); //13
printf("%d\n",fib(50));//-298632863/出现了越界
return 0;
}
long fib(size_t n)
{
if (n == 1 || n ==2)
{
return 1;
}
long f1 = 1;
long f2 = 1;
long f = 0;
for (int i=3;i<=n;i++)
{
f = f1+f2;
f1 = f2;
f2 = f;
}
return f;
}
int main()
{
printf("%d\n",fib(1)); //1
printf("%d\n",fib(2)); //1
printf("%d\n",fib(6)); //8
printf("%d\n",fib(7)); //13
printf("%d\n",fib(50));//-298632863/出现了越界
return 0;
}