[백준 9095] 1, 2, 3 더하기 (DP) (C/C++)

#include <iostream>
#include <algorithm>
#include <string.h>
using namespace std;
 
int T;
int num;
int dp[20];
 
int solve(int n)
{
    if(n < 0)
    {
        return 0;
    }
    else if(n == 0)
    {
        return 1;
    }
    
    if(dp[n] != 0)
    {
        return dp[n];
    }
    
    dp[n] = solve(n-1) + solve(n-2) + solve(n-3);
    
    return dp[n];
}
 
int main(void)
{
//    freopen("B9095_input.txt", "r", stdin);
    
    cin >> T;
 
    for(int i = 1; i <= T; i++)
    {
        cin >> num;    
        
        cout << solve(num) << endl;
    }
    
    return 0;
}