Pagini recente » Cod sursa (job #2781546) | Cod sursa (job #1227813) | Cod sursa (job #2048640) | Cod sursa (job #1662831) | Cod sursa (job #425980)
Cod sursa(job #425980)
#include<iostream>
#include<fstream>
using namespace std;
ifstream fin("economie.in");
ofstream fout("economie.out");
int V[1002],n,i,j,k,update[1002],affirmative,x,minim,ciur[100000];
int cmp(int i, int j)
{
return j>i;
}
int main()
{
fin>>n;
for(i=1;i<=n;i++)
fin>>V[i];
sort(V,V+n+1,cmp);
update[1]=V[1];
ciur[V[1]]=1;
for(x=2;x*i<=50005;x++)
ciur[x*i]=1;
minim++;
k=2;
for(i=2;i<=n;i++)
for(x=2;x*V[i-1]<=50005;x++)
ciur[x*V[i-1]]=1;
for(i=2;i<=n;i++)
if(ciur[i]==1)
for(j=i+1;j<=50002;j++)
if(ciur[j]==1)
ciur[j+i]=1;
for(i=2;i<=n;i++)
if(ciur[V[i]]==0)
{
minim++;
update[k++]=V[i];
}
fout<<minim<<"\n";
for(i=1;i<=k-1;i++)
{
fout<<update[i];
if(i!=k-1)
fout<<"\n";
}
return 0;
}