[2748] 피보나치 수 2

#include <iostream>
#define MAX 90
using namespace std;
long iterative_fib(int n);
int main()
{
	int n;
	cin >> n;
	cout << iterative_fib(n) << endl;
	return 0;
}
long iterative_fib(int n)
{
	long fib[MAX], i;
	fib[0] = 0;
	fib[1] = 1;
	for (i = 2; i <= n; i++)
		fib[i] = fib[i - 1] + fib[i - 2];
	return fib[n];
}