Pagini recente » Cod sursa (job #908023) | Cod sursa (job #465495) | Cod sursa (job #569601) | Cod sursa (job #2327415) | Cod sursa (job #1142625)
#include <cstdio>
#include <algorithm>
using namespace std;
int main()
{
freopen("economie.in","r",stdin);
freopen("economie.out","w",stdout);
int n,i,j,k;
scanf("%d",&n);
int v[n],x[n+1];
x[0]=0;
for(i=0;i<n;i++)
{
scanf("%d",&v[i]);
}
sort(v,v+n);
x[++x[0]]=v[0];
for(i=1;i<n;i++)
{ k=x[0];
for(j=1;j<=k;j++)
{
if(v[i]%x[j]!=0) x[++x[0]]=v[i];
else break;
}
}
printf("%d\n",x[0]);
for(i=1;i<=x[0];i++) printf("%d\n",x[i]);
}