[dp] 백준 1309 동물원

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

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