Cod sursa(job #2112646)
| Utilizator | Data | 23 ianuarie 2018 18:57:12 | |
|---|---|---|---|
| Problema | Economie | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.64 kb |
#include<fstream>
#include<algorithm>
using namespace std;
ifstream fin("economie.in");
ofstream fout("economie.out");
int Poz[50003],V[1003],N,Sol[1003],Nr;
int main()
{
fin>>N;
for(int i=1;i<=N;i++)
fin>>V[i];
sort(V+1,V+1+N);
Poz[0]=1;
for(int i=1;i<=N;i++)
{
if(Poz[V[i]]==0)
{
for(int j=0;j<=50000;j++)
if(j+V[i]>50000)
break;
else
if(Poz[j]==1)
Poz[j+V[i]]=1;
Nr++;
Sol[Nr]=i;
}
}
fout<<Nr<<'\n';
for(int i=1;i<=Nr;i++)
fout<<Sol[i]<<'\n';
}
