D - Round Subset codeforces837d

D - Round Subset

思路：背包；

代码：

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define ll long long
ll n,m,dp[][],tmp,p2,p5,pos,sum,ans;
int main()
{
    //freopen("data.txt","r",stdin);
    scanf("%lld%lld",&n,&m);
    memset(dp,-0x7f,sizeof(dp)),dp[][]=;;
    for(ll i=;i<=n;i++)
    {
        cin>>tmp,pos=tmp,p5=,p2=;
        while(pos%==) pos/=,p2++;
        while(tmp%==) tmp/=,p5++;
        sum+=p5;
        for(ll v=min(i,m);v>=;v--)
            for(ll e=sum;e>=p5;e--) dp[v][e]=max(dp[v][e],dp[v-][e-p5]+p2);
    }
    for(ll i=;i<=sum;i++) ans=max(ans,min(i,dp[m][i]));
    cout<<ans;
    return ;
}