-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathminimumPluses.cpp
54 lines (39 loc) · 1 KB
/
minimumPluses.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
51
52
53
54
#include<bits/stdc++.h>
using namespace std;
#define intl long long int
intl dp[1000][5000];
intl min_plus(string &x, intl y, intl idx) {
if (y < 0)
return INT_MAX;
if (idx == x.length())
return (y == 0 ? 0 : INT_MAX);
if (dp[idx][y] != -1)
{
return dp[idx][y];
}
intl ans = INT_MAX;
for (intl i = idx; i < min(idx + 4, (intl)x.length()); i++) {
intl num = stoi(x.substr(idx, i - idx + 1));
if (i < x.length() - 1)
{
ans = min(ans, min_plus(x, y - num, i + 1) + 1);
} else {
ans = min(ans, min_plus(x, y - num, i + 1));
}
}
return dp[idx][y] = ans;
}
int main() {
memset(dp, -1, sizeof dp);
string x;
cin >> x;
intl i = 0;
while (x[i] != '=')i++;
intl n = x.size();
string x1 = x.substr(0, i);
intl y = stoi(x.substr(i + 1, n - 1));
intl ans = min_plus(x1, y, 0);
if (ans == INT_MAX) cout << -1 << " ";
else cout << ans << " ";
return 0;
}