Cod sursa(job #2757872)
| Utilizator | Data | 7 iunie 2021 00:11:21 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | c-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <stdio.h>
#include <string.h>
#include <math.h>
char sev[2000005];
int n, sol;
int main()
{
freopen("input.in", "r", stdin);
freopen("output.out", "w", stdout);
scanf("%d", &n);
int i, j;
memset(sev, 1, n+1);
for(i = 2; i <=n; i++)//i <= n; pentru a se calcula toate sol
if(sev[i])
{
sol++;
for(j = i*2; j<=n; j+=i)
sev[j] = 0;
}
printf("%d\n", sol);
return 0;
}
