Cod sursa(job #630714)
Utilizator | Data | 6 noiembrie 2011 13:54:11 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include <stdio.h>
bool prim[2000000];
int main()
{
long n, sol, i, j;
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
scanf("%ld", &n);
sol=0;
for (i=2; i<n; i++)
if (prim[i]==0)
{
sol++;
for (j=i*2; j<n; j+=i)
prim[j]=1;
}//if
printf("%ld\n", sol);
return 0;
}//main