CodeForces - 837D(98/600)

Let’s call the roundness of the number the number of zeros to which it ends.

You have an array of n numbers. You need to choose a subset of exactly k numbers so that the roundness of the product of the selected numbers will be maximum possible.

Input
The first line contains two integer numbers n and k (1 ≤ n ≤ 200, 1 ≤ k ≤ n).

The second line contains n space-separated integer numbers a1, a2, …, an (1 ≤ ai ≤ 1018).

Output
Print maximal roundness of product of the chosen subset of length k.

Example
Input
3 2
50 4 20
Output
3
Input
5 3
15 16 3 25 9
Output
3
Input
3 3
9 77 13
Output
0
Note
In the first example there are 3 subsets of 2 numbers. [50, 4] has product 200 with roundness 2, [4, 20] — product 80, roundness 1, [50, 20] — product 1000, roundness 3.

In the second example subset [15, 16, 25] has product 6000, roundness 3.

In the third example all subsets has product with roundness 0.

01背包裸题

（为什么我多一个log都过不去啊混蛋卡那么严

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int  dp[201][15000];
long long   tu[201];
int  er[201], wu[201];
#define max(a,b)    (((a) > (b)) ? (a) : (b))
#define min(a,b)    (((a) < (b)) ? (a) : (b))
int  main()
{
    int  n, k;
    cin >> n >> k;
    for (int a = 1; a <= n; a++)cin >> tu[a];
    int  ee = 0, ww = 0;
    for (int a = 1; a <= n; a++)
    {
        long long   t = tu[a];
        while (t % 5 == 0)
        {
            wu[a]++;
            ww++;
            t /= 5;
        }
        while (t % 2 == 0)
        {
            er[a]++;
            ee++;
            t /= 2;
        }
    }
/*  for (int a = 1; a <= n; a++)cout << er[a] << " ";
    cout << endl;
    for (int a = 1; a <= n; a++)cout << wu[a] << " ";
    return 0;*/
    memset(dp, -0x3f, sizeof(dp));
    dp[0][0] = 0;
    for (int a = 1; a <= n; a++)
    {
        for (int b = k;b>=0; b--)
        {
            if (b - 1 < 0)break;
            for (int c = ee; c >= 0; c--)
            {
                if (c - er[a] < 0)break;
                dp[b][c] = max(dp[b][c], dp[b - 1][c - er[a]] + wu[a]);
            }
        }
    }
/*  for (int a = 0; a <= k; a++)
    {
        for (int b = 0; b <= ee; b++)
        {
            if (dp[a][b] < 0)cout << 0;
            else cout << dp[a][b];
            cout << " ";
        }
        cout << endl;
    }
    return 0;
*/  int dan = 0;
    for (int a = 0; a <= ee; a++)dan = max(dan, min(a, dp[k][a]));
    cout << dan;
}