-
Notifications
You must be signed in to change notification settings - Fork 10
/
CHNTOWER.cpp
50 lines (41 loc) 路 1.04 KB
/
CHNTOWER.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef unsigned long long ull;
#define X first
#define Y second
#define pb push_back
#define mp make_pair
#define ep emplace_back
#define EL printf("\n")
#define sz(A) (int) A.size()
#define FOR(i,l,r) for (int i=l;i<=r;i++)
#define FOD(i,r,l) for (int i=r;i>=l;i--)
#define fillchar(a,x) memset(a, x, sizeof (a))
#define faster ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
ll n, m, f[100][100];
int main() {
// freopen("INP.TXT", "r", stdin);
// freopen("OUT.TXT", "w", stdout);
for (int i=1; i<=64; i++)
for (int j=3; j<=64; j++)
if (j == 3) {
f[i][j] = 1;
for (int k=1; k<=i; k++) f[i][j] *= 2;
f[i][j]--;
} else if (i == j)
f[i][j] = 2*i+1;
else if (i < j)
f[i][j] = 2*i-1;
else {
f[i][j] = LONG_LONG_MAX;
for (int k=1; k<i; k++)
f[i][j] = min(f[i][j], 2*f[k][j]+f[i-k][j-1]);
}
while (scanf("%lld", &n) == 1) {
scanf("%lld\n", &m);
printf("%lld\n", f[n][m]);
}
return 0;
}