Cod sursa(job #878197)
| Utilizator | Data | 14 februarie 2013 09:23:34 | |
|---|---|---|---|
| Problema | Economie | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.58 kb |
#include<cstdio>
#include<algorithm>
using namespace std;
bool k[50005];
int main()
{
freopen("economie.in","r",stdin);freopen("economie.out","w",stdout);
int v[1500],n,i,lim,j;bool ok=0;
scanf("%d",&n);
for(i=1;i<=n;++i)
scanf("%d",&v[i]);
sort(v+1,v+n+1);
lim=v[n];
for(i=1;i<=n&&!ok;++i)
{
ok=1;
for(j=v[i];j<=lim;j+=v[i])
k[j]=1;
for(j=i+1;j<=n&&ok;++j)
if(!k[v[j]])
ok=0;
}
printf("%d\n",i-1);
for(j=1;j<=i-1;++i)
printf("%d\n",v[j]);
}
