Pagini recente » Cod sursa (job #1861677) | Cod sursa (job #2540219) | Cod sursa (job #1833362) | Cod sursa (job #1338338) | Cod sursa (job #558296)
Cod sursa(job #558296)
#include <fstream>
using namespace std;
int m,i,j,n,v[1000],x[1000],b[1000],a[1000],k,l,ok;
ifstream f ("economie.in");
ofstream g ("economie.out");
int main (){
f>>n;
for(i=1;i<=n;i++)
{
f>>v[i];
if(v[i]>m)
m=v[i];
}
sort(v+1,v+n+1);
for(i=1;i<=m;i++)
b[i]=99999999;
for(i=1;i<=n;i++)
b[v[i]]=1;
a[0]=1;
for(i=1;i<=n;i++)
{
for(j=0;j<=m;j++)
if(a[j])
a[j+v[i]]=1;
for(j=1;j<=n;j++)
if(b[i]>=a[i])
ok=1;
else
ok=0;
if(ok){
for(l=i;l>=1;l--)
x[++k]=l;
break;
}
}
g<<k<<"\n";
for(i=1;i<=k;i++)
g<<x[i]<<"\n";
return 0;
}