Cod sursa(job #2276443)
Utilizator | Data | 4 noiembrie 2018 18:53:01 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<fstream>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int n,i,j,v[2000000]={0},nr=1;
int main ()
{
fin>>n;
for(i=3;i*i<=n;i+=2)
{
if(v[i]==0)
for(j=2;j<=n/i;j++)
v[i*j]=1;
}
for(i=3;i<=n;i+=2)
if(v[i]==0)
nr++;
fout<<nr;
return 0;
}