Pagini recente » Cod sursa (job #725619) | Cod sursa (job #2123556) | Cod sursa (job #2143066) | Cod sursa (job #647512) | Cod sursa (job #186554)
Cod sursa(job #186554)
#include <stdio.h>
#include <algorithm>
using namespace std;
int i,j,k,n,m;
int a[1010],b[1010];
int c[50010];
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 (c[a[i]]==0)
{
m++;b[m]=a[i];
j=a[i];
while (j<=a[n])
{
c[j]=1;
j+=a[i];
}
}
printf("%d\n",m);
for (i=1; i<=m; i++) printf("%d\n",b[i]);
return 0;
}