Cod sursa(job #1894176)
Utilizator | Data | 26 februarie 2017 16:27:51 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <stdio.h>
using namespace std;
int N, p[2000005], nr;
int main()
{
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
scanf("%d", &N);
nr++;
for(int i = 3; i <= N; i += 2)
if(!p[i])
{
nr++;
for(int j = i*i; j <= N; j += i + i)
p[j] = 1;
}
printf("%d\n", nr);
return 0;
}