Cod sursa(job #2357081)
Utilizator | Data | 27 februarie 2019 09:27:28 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
const int VM = 2000001;
bool c[VM];
ifstream in("ciur.in");
ofstream out("ciur.out");
int main()
{
int n, nr=0, i, j;
in >> n;
for(i=2; i*i<VM; i++)
if(!c[i]){
for(j=i*i; j<VM; j+=i)
c[j]=true;
}
for(i=2; i<n; i++)
if(!c[i])
nr++;
out << nr;
return 0;
}