Mai intai trebuie sa te autentifici.
Cod sursa(job #838148)
| Utilizator | Data | 19 decembrie 2012 00:13:27 | |
|---|---|---|---|
| Problema | Economie | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.96 kb |
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<vector>
int n,a[50005],c[10005],k;
unsigned int v[10005];
void generare()
{
int i;
std::scanf("%d",&n);
for(i=1;i<=n;i++)
std::scanf("%d",&v[i]);
std::fclose(stdin);
}
void rezolvare()
{
int i,j;
std::sort(v+1,v+n+1);
if(v[1]==1)
{
k=1;
c[1]=1;
return ;
}
for(i=1;i<=n;i++)
if(a[v[i]]!=1)
{
a[v[i]]=0;
for(j=v[i];j<=v[n];j+=v[i])
{
a[v[i]+j]=1;
}
}
for(i=1;i<=n;i++)
if(a[v[i]]==0)
{
c[++k]=v[i];
}
return ;
}
void afisare()
{
int i;
std::printf("%d",k);
std::printf("\n");
for(i=1;i<=k;i++)
{
std::printf("%d",c[i]);
std::printf("\n");
}
std::fclose(stdout);
}
int main()
{
std::freopen("economie.in","r",stdin);
std::freopen("economie.out","w",stdout);
generare();
rezolvare();
afisare();
return 0;
}
