Pagini recente » Borderou de evaluare (job #2010968) | Borderou de evaluare (job #796670) | Cod sursa (job #905451) | Borderou de evaluare (job #2912165) | Cod sursa (job #485127)
Cod sursa(job #485127)
#include<fstream.h>
int t,r,nr,n,x[20],g,a[20],s,min,uz[20];
ofstream fout("zebughil.out");
void back(int k,int maxd)
{int i;
if(k>n)
{if(maxd<min)
min=maxd;
}
else
for(i=1;i<=n;++i)
if(!uz[i])
{s+=a[i];
x[k]=a[i];
uz[i]=1;
r=s;
if(s>g)
{s=a[i];
back(k+1,maxd+1);
}
else
back(k+1,maxd);
s=r-a[i];
uz[i]=0;
}
}
int main()
{ifstream fin("zebughil.in");
int i;
while(!fin.eof())
{fin>>n>>g;
for(i=1;i<=n;++i)
fin>>a[i];
s=0;
min=2000000001;
int maxd=1;
back(1,maxd);
fout<<min<<"\n";
}
fin.close();
fout.close();
return 0;
}