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