[백준 1904] 타일 (DP) (C/C++)

#include <iostream>
#include <algorithm>
#include <string.h>
using namespace std;
 
int N;
int dp[1000010];
 
int solve(int n)
{
    if(n == 0)
    {
        return 1;
    }
    else if(n < 0)
    {
        return 0;
    }
    
    if(dp[n] != 0)
    {
        return dp[n];
    }
    
    dp[n] = solve(n-1) % 15746 + solve(n-2) % 15746;
    
    return dp[n] % 15746;
}
 
int main(void)
{
//    freopen("B1904_input.txt", "r", stdin);
 
    cin >> N;
    
    cout << solve(N);
    
    return 0;
}