Pagini recente » Cod sursa (job #2131344) | Cod sursa (job #1383887) | Cod sursa (job #2584928) | Cod sursa (job #1374178) | Cod sursa (job #2701436)
#include <fstream>
#define inf 2000000000
using namespace std;
ifstream fin("zebughil.in");
ofstream fout("zebughil.out");
int n,g,v[20],pmax,ii;
struct elem
{
int c,g;
}dp[(1<<17)+1];
int main()
{
for(int t=1;t<=3;t++)
{
fin>>n>>g;
pmax=(1<<n);
for(int i=1;i<pmax;i++)
dp[i].c=inf;
dp[0].c=1;
for(int i=1;i<=n;i++)
fin>>v[i];
for(int i=1;i<pmax;i++)
{
for(int j=0;j<n;j++)
{
if((i>>j)&1)
{
ii=i-(1<<j);
if(dp[ii].c!=inf)
{
if(dp[ii].g+v[j+1]<=g)
{
if(dp[ii].c<dp[i].c||dp[ii].c==dp[i].c&&dp[ii].g+v[j+1]<dp[i].g)
{
dp[i].c=dp[ii].c;
dp[i].g=dp[ii].g+v[j+1];
}
}
else
if(dp[ii].c+1<dp[i].c||dp[ii].c+1==dp[i].c&&dp[i].g>v[j+1])
{
dp[i].c=dp[ii].c+1;
dp[i].g=v[j+1];
}
}
}
}
}
fout<<dp[pmax-1].c<<"\n";
}
return 0;
}