Cod sursa(job #2303630)
Utilizator | Data | 16 decembrie 2018 17:32:43 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
#define N 2000001
using namespace std;
int L[N];
int main()
{
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
int n, db = 0;
scanf("%d", &n);
for(int i = 2; i < n; ++i){
L[i] = 1;
}
for(int i = 2; i < n; ++i){
if(L[i]){
db++;
for(int j = i*i; j < n; j = j + i){
L[j] = 0;
}
}
}
printf("%d\n", db);
return 0;
}