codeup Fibonacci

#include<iostream>
using namespace std;

int dp[32];
int F(int n) {
	if (n == 0 )
		return 0;
	if (n == 1)
		return 1;
	if (dp[n] != -1) {
		return dp[n];
	}
	else {
		dp[n] = F(n - 1) + F(n - 2);
		return dp[n];
	}
}

int main() {
	int n;
	while (scanf_s("%d", &n) != EOF) {
		for (int i = 0;i <= n;i++)
			dp[i] = -1;

		printf("%d\n", F(n));
	}
	system("pause");
	return 0;

}