Cod sursa(job #1491624)
Utilizator | Data | 25 septembrie 2015 19:17:26 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include<stdio.h>
using namespace std;
#define M 2000001
int f[M], N;
void read()
{
scanf("%d", &N);
}
void ciur()
{
int i, j, nr = 0;
for(i = 2; i <= N; i++)
if(f[i] == 0)
{
nr++;
for(j = i + i; j <= N; j += i)
f[j] = 1;
}
printf("%d", nr);
}
int main()
{
freopen("ciur.in","r", stdin);
freopen("ciur.out","w",stdout);
read();
ciur();
fclose(stdin);
fclose(stdout);
return 0;
}