//依然是递归的问题,答案同斐波那契数列。有所改动之处在于初始的值。这也是不同的斐波那契数列的区别
#include <iostream>
#include <string>
#include <stdio.h>
using
namespace
std;
long
long
Fibonacci(
int
n)
{
if
(n==1)
{
return
1;
}
else
if
(n==2)
{
return
2;
}
else
{
long
long
a =1,b=2;
long
long
p=0;
for
(
int
i=3;i<=n;i++)
{
p=a+b;
a=b;
b=p;
}
return
p;
}
}
int
main()
{
int
m;
while
(cin>>m)
{
cout<<Fibonacci(m)<<endl;
}
return
0;
}
/**************************************************************
Problem: 1390
User: 无梦楼主lv
Language: C++
Result: Accepted
Time:10 ms
Memory:1520 kb
****************************************************************/