Fibonacci

#include <bits/stdc++.h>
#include <cstdlib>

using namespace std;


const long long int N = 101;
long long int cnt[10];
long long int dp[N];

long long int f (long long int x){
	if(x <= 1) {
		return 1;
	}
	if (dp[x] != -1){
		return dp[x];
	}
	return dp[x] = f (x-1) + f(x-2);
}

int main (void) {
	memset (dp, -1, sizeof dp); // Coloca determinado valor no vetor, só funciona com -1 e 0
	cout<< f(99) << endl;
}