/*
ID: xujiahe1
PROG: nuggets
LANG: C++
*/
#include <iostream>
#include <cstring>
#include <algorithm>
#include <algorithm>
#include <cstdio>
using namespace std;
int save[11000],n;
bool dp[110000];
int gcd(int x,int y)
{
if(x==0) return y;
return gcd(y%x,x);
}
int main()
{
freopen("nuggets.in","r",stdin);
freopen("nuggets.out","w",stdout);
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d",&save[i]);
}
int k=save[1];
for (int i=2;i<=n;i++)
k=gcd(k,save[i]);
if(k!=1)
{
cout<<0<<endl;
return 0;
}
dp[0]=1;
for(int i=1;i<=65536;i++)
{
for(int j=1;j<=n;j++)
{
if(i>=save[j])
{
dp[i]=dp[i]||dp[i-save[j]];
}
}
}
for(int i=65536;i>=0;i--)
{
if(!dp[i])
{
printf("%d\n",i);
return 0;
}
}
cout<<0<<endl;
return 0;
}
usaco nuggets 01背包
最新推荐文章于 2019-08-02 11:20:42 发布