class Solution { public: int Fibonacci(int n) { int a[50]; a[0] = 0, a[1] = 1; for(int i = 2; i <= 50; i++) a[i] = a[i - 1] + a[i - 2]; return a[n]; } };
