Cod sursa(job #2387754)
Utilizator | Data | 25 martie 2019 10:43:12 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <iostream>
#include <fstream>
using namespace std;
bool v[2000001];
long n,i,nr,j;
ifstream in("ciur.in");
ofstream out("ciur.out");
int main()
{in>>n;
nr=1;
v[1]=1;
for(j=2+2;j<=n;j+=2)
v[i]=1;
for(i=3;i<=n;i+=2)
{if(v[i]==0)
nr++;
for(j=i+i;j<=n;j+=i)
v[j]=1;
}
out<<nr;
return 0;
}