//17_fibonacci.cpp
//To calculate the n-th number of the Fibonacci sequence. - Using memorized search, without a vector but a GLOBAL array
//DEBUGGING ON codepad
#include <iostream>
#include <cstring>
using std::cin;
using std::cout;
const int MAXN=(46+4);
int mem[MAXN]={0};
int fbnci(int n);
int main() {
int n=19;
//cin>>n;
for (int i=0; i<=n; i++) {
cout<<fbnci(i)<<"\n\n";
memset(mem, 0, sizeof(mem));
}
return 0;
}
int fbnci(int n) {
if (mem[n]!=0) {
cout<<n<<":MEM"<<mem[n]<<"\n";
return mem[n];
}
else {
mem[n]=(n==0||n==1)?1:(fbnci(n-2)+fbnci(n-1));
cout<<n<<":CEA"<<mem[n]<<"\n";
return mem[n];
}
}
yhl20001210
-
C++,
pasted
on Aug 26: