[백준 2163] 초콜릿 자르기 (DP) (C/C++)

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