Pagini recente » Cod sursa (job #2924492) | Cod sursa (job #1130011) | Cod sursa (job #3251401) | Cod sursa (job #929738) | Cod sursa (job #3172796)
#include <fstream>
#include <cstring>
using namespace std;
ifstream fin("zebughil.in");
ofstream fout("zebughil.out");
long long n,g,v[100],d[3000001];
void solve()
{
memset(d,0,sizeof(d));
fin>>n>>g;
for(int i=0;i<n;i++){
fin>>v[i];
d[(1<<i)]=1;
}
long long mers=(1<<n)-2;
for(int i=1;i<=mers+1;i++){
if(d[i]==0)
d[i]=n+1;
}
for(int i=1;i<=mers;i++)
{
long long s=0;
for(int p=0;p<n;p++)
{
if((i>>p)&1)
s+=v[p];
}
if(s<=g)
d[i]=1;
for(int p=0;p<n && i+(1<<p)<=mers+1;p++)
{
if(!((i>>p)&1))
{
if(v[p]+s<=g)
d[i+(1<<p)]=1;
d[i+(1<<p)]=min(d[i+(1<<p)],d[i]+d[(1<<p)]);
}
}
}
for(int i=1;i<=mers;i++)
{
d[(1<<n)-1]=min(d[(1<<n)-1],d[i]+d[(1<<n)-1-i]);
}
fout<<d[(1<<n)-1]<<"\n";
}
int main()
{
for(int p=1;p<=3;p++)
solve();
return 0;
}