解题思路:
(1)菲波那切数列
#include<iostream>
using namespace std;
int helper(int n) {
if(n<=2) return 1;
int a=1,b=1,c;
int i=3;
while(i<=n) {
c=a+b;
a=b;
b=c;
i++;
}
return c;
}
int main() {
int n;
while(cin>>n) {
cout<<helper(n)<<endl;
}
return 0;
}