#include
using namespace std;
int fib_func(int count){ //递归方法
if(count == 1||count == 2){
return 1;
}
return fib_func(count - 1) + fib_func(count - 2);
}
int main(){
int fib[2];
fib[0] = 1;
fib[1] = 1;
int count = 2;
while(count < 20){//递推
int tmp = fib[0] + fib[1];
fib[0] = fib[1];
fib[1] = tmp;
count++;
}
cout< cout< return 0;
}
