BOJ)2193 이친수

https://www.acmicpc.net/problem/2193

1

1 0         1

10 0/1         2

100 0/1         3

101 0

1000 0/1 5

1001 0

1010 0/1 

#include <iostream>
using namespace std;
long long dp[91];
 
int main()
{
 
    dp[1] = 1;
    dp[2] = 1;
    int n;
    cin >> n;
    for (int i = 3; i <= n; i++) {
        dp[i] = dp[i - 1] + dp[i - 2];
    }
    cout << dp[n];
}