Cod sursa(job #1245482)
| Utilizator | Data | 19 octombrie 2014 12:16:05 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <cstdio>
#include <cmath>
using namespace std;
bool c[2000005];
void sieve(int N)
{
int lim=(int)sqrt((double)N);
c[0]=c[1]=true;
for(int i=4;i<=N;i+=2)
c[i]=true;
for(int i=3;i<=lim;i+=2)
if(!c[i])
for(int j=i*i;j<=N;j+=2*i)
c[j]=true;
}
int main()
{
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
int N;
scanf("%d", &N);
sieve(N);
int nr=0;
for(int i=2;i<=N;i++)
if(!c[i])nr++;
printf("%d\n", nr);
return 0;
}
