Cod sursa(job #2641867)
Utilizator | Data | 12 august 2020 22:30:23 | |
---|---|---|---|
Problema | Economie | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 1.39 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f ("economie.in");
ofstream g ("economie.out");
int v[1001],w[50001];
int main ()
{
int i,j,n,x,z,y,s;
f>>n;
for(i=1; i<=n; i++)
f>>v[i];
for(i=1; i<n; i++)
for(j=i+1; j<=n; j++)
if(v[i]>v[j])
{
x=v[i];
v[i]=v[j];
v[j]=x;
}
z=0;
if(v[1]==1) g<<1<<"\n"<<1;
else
{
for(i=v[1]; i<=v[n]; i++)
if (w[i]==0)
{
y=0;
for(k=1; k<=n; k++)
if(v[k]==i) y=1;
if(y==1)
{
w[i]=1;
z+=1;
for(j=v[1]; j<=v[n]; j++)
{
s=j+i;
if(w[j]!=0 && s<=v[n]) w[s]=2;
}
}
}
g<<z<<endl;
for(i=v[1]; i<v[n]; i++)
if(w[i]==1) g<<i<<endl;
}
f.close();
g.close();
return 0;
}