Pagini recente » Cod sursa (job #1641609) | Cod sursa (job #3132564) | Cod sursa (job #1886766) | Cod sursa (job #86960) | Cod sursa (job #838495)
Cod sursa(job #838495)
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<vector>
int n,a[500005],c[100005],k;
unsigned int v[100005];
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)
{
c[++k]=1;
return ;
}
for(i=1;i<=n;i++)
{
if(a[v[i]]==0)
{
c[++k]=v[i];
}
for(j=v[i];j<=v[n]+1;j+=v[i])
a[j+v[i]]=1;
for(j=0;j+v[i]<=v[n]+1;j++)
if(a[j]==1)
a[j+v[i]]=1;
}
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;
}