Pagini recente » Cod sursa (job #166762) | Cod sursa (job #1074002) | Cod sursa (job #495658) | Cod sursa (job #887422) | Cod sursa (job #1112510)
#include <fstream>
#define max 2000000
#define max2 45000
#include <bitset>
using namespace std;
int main()
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bitset<max>v;
int prim[max2];
int n,i,j,k=0;
prim[0]=2;
fin>>n;
for(i=4;i<=n;i+=2)
v[i]=1;
for(i=3;i<=n;i+=2)
if(v[i]==0)
{
prim[++k]=i;
for(j=i*i;j<=max;j=j+2*i)
v[j]=1;
}
for(i=0;i<=k;i++)
fout<<prim[i]<<"\n";
return 0;
}