#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long int64;
const int INF = 0x3F3F3F3F;
const int N = 65;
int n,m;
int64 dp[N][N];
int main() {
scanf("%d%d",&n,&m);
for(int i = 0; i < N; ++i)
for(int j = 0; j < N; ++j)
dp[i][j] = 1LL << 61;
dp[3][0] = 0;
for(int i = 1; i <= n; ++i) dp[3][i] = dp[3][i-1]<<1 | 1;
for(int i = 4; i <= m; ++i) dp[i][0] = 0, dp[i][1] = 1;
for(int i = 4; i <= m; ++i)
for(int j = 2; j <= n; ++j)
for(int k = 1; k < j; ++k)
dp[i][j] = min(dp[i][j], dp[i][j-k]*2 + dp[i-1][k]);
printf("%lld\n", dp[m][n]);
return 0;
}
n柱汉诺塔
最新推荐文章于 2023-05-14 10:45:42 发布