Cod sursa(job #2889923)
Utilizator | Data | 13 aprilie 2022 20:01:28 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | c-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <stdio.h>
#include <stdlib.h>
int ciur[2000005];
int main() {
int n;
scanf("%d", &n);
for(int i = 4; i <= n; i += 2)
ciur[i] = 1;
for(int i = 3; i * i < n; i += 2)
for(int j = i * i; j <= n; j += 2 * i)
ciur[j] = 1;
int cnt = 1;
for(int i = 3; i <= n; i += 2)
if(ciur[i] == 0)
cnt++;
printf("%d\n", cnt);
return 0;
}