Cod sursa(job #1133881)
| Utilizator | Data | 5 martie 2014 19:25:32 | |
|---|---|---|---|
| Problema | Economie | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.58 kb |
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<bitset>
using namespace std;
bitset<50005>sum;
int n,i,j,k,v[1005],res[1005];
int main()
{
freopen("economie.in","r",stdin);
freopen("economie.out","w",stdout);
scanf("%d",&n);
for (i=1;i<=n;i++) scanf("%d",&v[i]);
sort(v+1,v+n+1);
for (i=1;i<=n;i++)
if (!sum[v[i]])
{
res[++k]=v[i];
for (j=i;j<=v[n];j=j+v[i])
sum[j]=1;
}
printf("%d\n",k);
for (i=1;i<=k;i++)
printf("%d\n",res[i]);
return 0;
}
