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