Pagini recente » Cod sursa (job #2004274) | Cod sursa (job #1996249) | Cod sursa (job #194745) | Cod sursa (job #1783347) | Cod sursa (job #110876)
Cod sursa(job #110876)
#include<stdio.h>
#include<algorithm>
using namespace std;
int w[1000];
int main () {
int n,v[1000],a[1000],i,nr=0,x=0,j;
freopen("economie.in","r",stdin);
freopen("economie.out","w",stdout);
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&v[i]);
sort(v,v+n);
for(i=0;i<n;i++)
if(w[i]==0){
w[i]=1;
a[x++]=v[i];
for(j=i+1;j<n;j++){
if(v[j]%v[i]==0)
w[j]=1;
}
}
printf("%d\n",x);
for(i=0;i<x;i++)
printf("%d\n",a[i]);
return 0;
}