Cod sursa(job #806965)
| Utilizator | Data | 3 noiembrie 2012 19:48:01 | |
|---|---|---|---|
| Problema | Economie | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.44 kb |
#include<cstdio>
#include<algorithm>
using namespace std;
int a[1001],b[50001],i,j,k,n,c[1001];
int main()
{freopen("economie.in","r",stdin),freopen("economie.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
sort(a+1,a+n+1);
for(i=1;i<=n;i++)
if(!b[a[i]])
{c[k++]=a[i];
for(j=1;j*a[i]<=50000;j++)
b[j*a[i]]=1;}
printf("%d\n",k);
for(i=0;i<k;i++)
printf("%d\n",c[i]);
return 0;}
