Pagini recente » Istoria paginii template/implica-te/scrie-articole-2 | tot-oni-2012-ziua1-11-12 | Istoria paginii runda/simulare-cartita-07/clasament | Monitorul de evaluare | Cod sursa (job #2069891)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int n,d,v[200000001],i,j,Q;
int main()
{
in>>n;
for (i=1;i<=n;i++) v[i]=i;
for (d=2;d*d<=n;d++)
{
for (j=2;j<=n;j++)
if (v[j]%d==0 && v[j]!=d) v[j]=0;
}
for (i=2;i<=n;i++)
{
if (v[i]!=0)
{
Q++;
cout<<v[i]<<" ";
}
}
out<<Q;
return 0;
}