Cod sursa(job #2502698)
Utilizator | Data | 1 decembrie 2019 14:09:28 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <cmath>
using namespace std;
bool ciur[2000000];
int main()
{
long long i,j,n;
cin>>n;
ciur[0]=1;
ciur[1]=1;
for(i=2;i<=n;i++)
{
ciur[i]=0;
}
for(i=4;i<=n;i=i+2)
{
ciur[i]=1;
}
for(i=3;i<=n;i=i+2)
{
for(j=2;j*i<=n;j++)
{
ciur[i*j]=1;
}
}
for(i=2;i<=n;i++)
{
if(ciur[i]==0)
cout<<i<<" ";
}
return 0;
}