Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- #define ll long long
- #define ld long double
- #define pi pair<ll, ll>
- #define F first
- #define S second
- #define pb push_back
- #define PI acos(-1.0)
- using namespace std;
- ll n, k, a[222], Two[222], Five[222];
- int Dp[2][210][200 * 65][2], tmp, Ans;
- bool Pick;
- int main()
- {
- ios::sync_with_stdio(0);
- cin.tie(0); cout.tie(0);
- // freopen("robots.in", "r", stdin);
- cin >> n >> k;
- for (int i=1; i<=n; i++){
- cin >> a[i];
- tmp = a[i]; while(tmp%2 == 0) Two[i]++, tmp /= 2;
- tmp = a[i]; while(tmp%5 == 0) Five[i]++, tmp /= 5;
- }
- for(int i = 0; i < 2; i++)
- for (int j = 0; j <= k; j++)
- for (int t = 0; t <= 60 * n; t++)
- for (int x = 0; x < 2; x++)
- Dp[i][j][t][x] = -1e9;
- for (int i = 0; i <= 65 * n; i++)
- Dp[(n+1)%2][0][i][0] = Dp[(n+1)%2][0][i][1] = 0;
- for(int i = n; i > 0; i--)
- for (int j = 1; j <= k; j++)
- for (int t = 0; t <= 60 * n; t++){
- Pick = (Five[i] > t + Two[i]);
- tmp = min(Five[i], t + Two[i]);
- Dp[i%2][j][t][0] = max(Dp[(i+1)%2][j][t][0], j ? Dp[(i+1)%2][j-1][max(Five[i], t + Two[i]) - tmp][Pick] + tmp : 0);
- Pick = (Five[i] + t > Two[i]);
- tmp = min(t + Five[i], Two[i]);
- Dp[i%2][j][t][1] = max(Dp[(i+1)%2][j][t][1], j ? Dp[(i+1)%2][j-1][max(t + Five[i], Two[i]) - tmp][Pick] + tmp : 0);
- }
- for (int i = 0; i <= 60 * n; i++)
- for (int j = 0; j < 2; j++)
- Ans = max(Ans, Dp[n%2][k][i][j]);
- cout << Ans << '\n';
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement