Cod sursa(job #2147263)
| Utilizator | Data | 28 februarie 2018 16:42:59 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.66 kb |
#include <cstdio>
#define N 2000002
using namespace std;
int n,cnt;
bool prime[N];
void eratosthenes(int n)
{
for(int i=4; i<=n; i=i+2)
{
prime[i]=1;
}
for(int i=3; i*i<=n; i=i+2)
{
if(!prime[i])
{
for(int j=i*i; j<=n; j=j+i)
{
prime[j]=1;
}
}
}
}
int main()
{
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
scanf("%d", &n);
eratosthenes(n);
for(int i=2; i<=n; i++)
{
if(!prime[i])
{
cnt++;
}
}
printf("%d\n", cnt);
return 0;
}
