Pagini recente » Cod sursa (job #2806593) | Cod sursa (job #2811043) | Cod sursa (job #1926580) | Cod sursa (job #1832868) | Cod sursa (job #308031)
Cod sursa(job #308031)
#include<fstream>
#include<stdlib.h>
using namespace std;
ifstream f1 ("economie.in");
ofstream f2 ("economie.out");
int v[50001];
int compar(const void*p, const void*q)
{
int x=*(int*)p, y=*(int*)q;
if (x>y) return 1;
if (x<y) return -1;
return 0;
}
int main()
{
int n,i,j,s,nr=0,k,val[1001];
f1>>n;
for (i=1; i<=n; i++) f1>>val[i];
qsort (val+1, n, sizeof(val[0]), compar);
i=1;
s=val[n];
while (i<=n)
{
while (v[val[i]]!=0 & i<=n) i++;
v[val[i]]=2;
for (j=1; j<=s; j++)
for (k=1; k<=i; k++) if (v[val[k]]==2) v[val[k]+val[i]]=1;
nr++;
i++;
}
nr--;
f2<<nr<<endl;
for (i=1; i<=n; i++) if (v[val[i]]==2) f2<<val[i]<<" ";
return 0;
}