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