Educational Codeforces Round 26 D dp

D. Round Subset

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

Examples

input

3 2
50 4 20

output

input

5 3
15 16 3 25 9

output

input

3 3
9 77 13

output

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.

题意:给你n个数取出k个 ans 为k个数乘积的结果的末尾的零的个数

题解:dp[i][j] 选择i个数因子5的个数为j 的2的个数为 dp[i][j]

 #pragma comment(linker, "/STACK:102400000,102400000")

 #include <bits/stdc++.h>

 #include <cstdlib>

 #include <cstdio>

 #include <iostream>

 #include <cstdlib>

 #include <cstring>

 #include <algorithm>

 #include <cmath>

 #include <cctype>

 #include <map>

 #include <set>

 #include <queue>

 #include <bitset>

 #include <string>

 #include <complex>

 #define LL long long

 #define mod 1000000007

 using namespace std;

 int n,k;

 LL a[];

 LL dp[][];

 struct node{

     int x,y;

 }N[];

 int main()

 {

     memset(dp,,sizeof(dp));

     scanf("%d %d",&n,&k);

     for(int i=; i<=n; i++)

         scanf("%I64d",&a[i]);

     for(int i=;i<=k;i++)

         for(int e=;e<=;e++)

          dp[i][e]=-1e9;

     dp[][]=;

     LL zha;

     int now=,xx=;

     for(int i=; i<=n; i++){

         zha=a[i];

         now=;

         xx=;

         while(zha>){

             if(zha%!=)

                 break;

             zha/=;

             now++;

         }

         zha=a[i];

         while(zha>){

             if(zha%!=)

                 break;

             zha/=;

             xx++;

         }

         N[i].x=now;

         N[i].y=xx;

     }

     for(int i=;i<=n;i++){

         for(int j=k-;j>=;j--){

              for(int e=;e<=;e++)

              dp[j+][e+N[i].x]=max(dp[j+][e+N[i].x],dp[j][e]+N[i].y);

         }

     }

     LL maxn=;

     for(LL e=;e<=;e++)

         maxn=max(maxn,min(dp[k][e],e));

     printf("%I64d\n",maxn);

     return ;

 }

巴特西

Educational Codeforces Round 26 D dp

最新文章

热门文章