Cod sursa(job #2047706)
| Utilizator | Data | 25 octombrie 2017 10:12:43 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.66 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("monezi2.in");
ofstream fout("monezi2.out");
int v[55], a[10005], p[100005];
int main()
{
int n,k,i,x,j;
fin>>n;
for(i=1;i<=n;i++)
{
fin>>x;
v[i]=v[i-1]+x;
}
fin>>k;
for(i=1;i<=n;i++)
{
for(j=1;j<=10005;j++)
{
if(p[j] && v[i]+j<=10005)
p[j+v[i]]=1;
if(j%v[i]==0)
p[j]=1;
}
}
for(i=1;i<=k;i++)
{
fin>>x;
if(p[x])
fout<<"DA";
else
fout<<"NU";
fout<<'\n';
}
return 0;
}
