Cod sursa(job #2173096)
Utilizator | Data | 15 martie 2018 20:30:00 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <cstdio>
#define N 2000005
using namespace std;
int x, nr;
bool nprim[N];
int main()
{
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
scanf("%d ", &x);
for(int i=4;i*i<=x;i+=2)
nprim[i]=1;
for(int i=3;i<=x;i+=2)
{
if(!nprim[i])
nr++;
for(int j=2*i;j<=x;j+=i)
nprim[j]=1;
}
if(x>=2)
nr++;
printf("%d", nr);
return 0;
}