Pagini recente » Cod sursa (job #209168) | Cod sursa (job #2395834) | Cod sursa (job #1647173) | Cod sursa (job #2139102) | Cod sursa (job #578205)
Cod sursa(job #578205)
# include <fstream>
# include <iostream>
# define max(a,b) (a>b?a:b)
using namespace std;
int n, C, g[20], d[132000][20], a[132000][20], sol;
int main()
{
ifstream fin ("zebughil.in");
ofstream fout ("zebughil.out");
int ho, p;
for(int t=1;t<=3;++t)
{
fin>>n>>C;
ho=(1<<n)-1;
for(int i=0;i<n;++i)
fin>>g[i];
for(int j=0;j<n;++j)
d[1<<j][1]=C-g[j], a[1<<j][1]=t;
for(int i=1;i<ho;++i)
for(int j=1;j<=n;++j)
if (a[i][j]==t)
{
for(int k=0;k<n;++k)
{
p=1<<k;
if (!(p&i))
{
if (d[i][j]>=g[k])
{
if (a[i+p][j]==t)d[i+p][j]=max(d[i+p][j],d[i][j]-g[k]);
else d[i+p][j]=d[i][j]-g[k], a[i+p][j]=t;
}
else
{
if (a[i+p][j+1]==t)d[i+p][j+1]=max(d[i+p][j+1],C-g[k]);
else d[i+p][j+1]=C-g[k], a[i+p][j+1]=t;
}
}
}
}
sol=0;
for(int i=1;i<=n && !sol;++i)
if (a[ho][i]==t)
sol=i;
fout<<sol<<"\n";
}
return 0;
}