Cod sursa(job #2778942)
| Utilizator | Data | 2 octombrie 2021 13:36:35 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <algorithm>
#define MAXN 2000005
using namespace std;
bool ciur[MAXN];
void precalc()
{
for(int i=2; i<MAXN; i++)
if(ciur[i]==0)
for(int j=2*i; j<MAXN; j+=i)
ciur[j]=1;
}
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
int n, cnt=0;
cin>>n;
precalc();
for(int i=2; i<=n; i++)
if(ciur[i]==0)
cnt++;
cout<<cnt;
return 0;
}
