Cod sursa(job #2124827)
Utilizator | Data | 7 februarie 2018 17:10:44 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in ("ciur.in");
ofstream out ("ciur.out");
bool p[2000005];
int main()
{
int n,nrp=0;
long long i,j;
in>>n;
for(i=2;i<=n;i++){
if(p[i]==0){
nrp++;
for(j=i*i;j<=n;j=j+i){
p[j]=1;
}
}
}
out <<nrp;
return 0;
}