Cod sursa(job #2343100)
Utilizator | Data | 13 februarie 2019 18:10:59 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <bits/stdc++.h>
using namespace std;
const int NMAX=2000005;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int N, v[NMAX], S=0;
int ciur(){
for(int i = 2; i * i <= N; i++)
if(!v[i]){
for(int j= i * i; j <= N; j += i)
v[j]=true;
}
}
int main() {
fin >> N;
ciur();
for(int i=0; i<N; i++)
S += v[i];
fout << S;
}