Cod sursa(job #2161826)
| Utilizator | Data | 11 martie 2018 21:09:49 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <bits/stdc++.h>
using namespace std;
int a[2000001],n;
void sieve(int n)
{
a[1]=1;
for(int i=2;i*i<=n;i++)
if(a[i]==0)
for(int j=i+1;i*j<=n;j++)
a[i*j]=1;
}
void date()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
}
int main()
{
int nr=0;
scanf("%d",&n);
sieve(n);
for(int i=1;i<=n;i++)
if(a[i]==0) nr++;
printf("%d\n",nr);
return 0;
}
