Cod sursa(job #1275159)
Utilizator | Data | 24 noiembrie 2014 20:31:07 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
# include <cstdio>
# define N (1<<21)
using namespace std;
bool prim[N];
int nr;
int main()
{
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
int n; scanf("%d\n", & n);
for(int i=1; i<=n; ++i) prim[i]=1;
for(int i=1; i<=n; ++i)
if(prim[i])
{
nr++;
for(int j=2*i; j<=n; j+=i)
prim[i]=0;
}
printf("%d\n", nr);
}