Cod sursa(job #2609085)
Utilizator | David Stefan Teaca david.teaca | Data | 2 mai 2020 10:24:24 |
---|---|---|---|
Problema | Zebughil | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.54 kb |
#include<fstream>
using namespace std;
ifstream f("zebughil.in");
ofstream g("zebughil.out");
int t,i,j,gr,k,n,n1,a[20],d[1000000];
int main(){
for(t=1;t<=3;++t)
{
f>>n>>gr;
for(i=1;i<=n;++i)
f>>a[i];
n1=1<<n;
for(i=0;i<n1;++i)
{
d[i]=-1;
}
d[0]=gr;
for(i=1;i<=n;++i)
{
for(j=0;j<n1;++j)
{
if(d[j]!=-1)
d[j]=gr;
for(k=1;k<=n;++k)
if(j&(1<<(k-1))&&d[j-(1<<(k-1))]-a[k]>d[j])
d[j]=d[j-(1<<(k-1))]-a[k];
}
if(d[n1-1]>-1)
{
g<<i<<'\n';
break;
}
}
}
return 0;
}