Cod sursa(job #1184143)
| Utilizator | Data | 11 mai 2014 15:27:51 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <stdio.h>
#include <math.h>
#define NX 2000010
char sieve[NX];
int main()
{
int N;
int count = 0;
freopen("ciur.in", "r", stdin);
//freopen("ciur.out", "w", stdout);
scanf("%d", &N);
for (int i = 2; i * i <= N; i++)
{
int square = i * i;
int j = i + 1;
if (sieve[square])
continue;
while (square <= N)
{
sieve[square] = 1;
square = i * j;
j++;
}
}
for (int i = 2; i < N; i++)
{
if (sieve[i] == 0)
{
count++;
}
}
printf("%d", count);
return 0;
}