Pagini recente » Cod sursa (job #211943) | Cod sursa (job #227719) | Cod sursa (job #2944981) | Cod sursa (job #1214129) | Cod sursa (job #1275938)
#include <iostream>
#include<fstream>
#include<algorithm>
#define Vmax 50000
using namespace std;
ifstream fin("economie.in");
ofstream fout("economie.out");
int M[1001],S[50005],n,sol[1001];
int main()
{
int i,k=0;
fin>>n;
for(i=1;i<=n;i++)
fin>>M[i];
sort(M+1,M+n+1);
S[0]=1;
for(i=1;i<=n;i++)
{
if(S[M[i]]==0)
sol[++k]=M[i];
int j=M[i];
while(j<=Vmax-M[i])
S[j]=1, j+=M[i];
}
fout<<k<<"\n";
for(i=1;i<=k;i++)
fout<<sol[i]<<"\n";
return 0;
}