Cod sursa(job #2260856)
Utilizator | Data | 15 octombrie 2018 17:54:01 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 90 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool NotPrim[2000000];
void ciur(int);
int main()
{ int n;
fin>>n;
ciur(n);
return 0;
}
void ciur(int B)
{
int sum = 0;
for( int i = 2 ; i <= B ; i++){
if( !NotPrim[i] ){
sum++;
for( int j = i + i ; j <= B ; j += i){
NotPrim[j] = true;
}
}
}
fout<<sum<<'\n';
}