Cod sursa(job #1174157)
| Utilizator | Data | 22 aprilie 2014 10:33:26 | |
|---|---|---|---|
| Problema | Economie | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.57 kb |
#include<stdio.h>
#include<algorithm>
using namespace std;
int v[1005],sol[1005];
int main()
{
int N,nr=0;
freopen("economie.in","r",stdin);
freopen("economie.out","w",stdout);
scanf("%d",&N);
for(int i=1;i<=N;++i)
scanf("%d",&v[i]);
sort(v+1,v+1+N);
sol[++nr]=v[1];
for(int i=2;i<=N;++i){
int j;
for(j=1;v[i]%sol[j] && j<=nr;j++);
if(j>nr) sol[++nr]=v[i];
}
printf("%d",nr);
for(int i=1;i<=nr;++i)
printf("\n%d",sol[i]);
fclose(stdin);fclose(stdout);
return 0;
}
