Cod sursa(job #2378759)
| Utilizator | Data | 12 martie 2019 16:42:18 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <iostream>
#include <fstream>
#include <math.h>
#define MAX 2000010
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int A[MAX];
void SieveOfErathostene(int p) {
for(int i = 1; i <p+1; i++)
A[i] = 1;
for(int i = 2; i < sqrt(p)+1; i++)
if(A[i])
for(int j = i * i; j <p+1; j = j + i)
A[j] = 0;
}
int main() {
int n, k = 0;
cin >> n;
SieveOfErathostene(n);
for(int i = 2; i <= n; i++)
if(A[i])
k++;
cout << k;
return 0;
}
