Cod sursa(job #2175353)
| Utilizator | Data | 16 martie 2018 16:48:25 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n, sol;
bool d[2000002];
void ciur()
{
for(int i=4; i<=n; i+=2)
d[i]=1;
for(int i=3; i*i<=n; i+=2)
if(!d[i])
{
for(int j=i*i; j<=n; j+=2*i)
d[j]=1;
}
}
int main()
{
fin>>n;
ciur();
for(int i=2; i<=n; i++)
if(!d[i]) ++sol;
fout<<sol<<'\n';
return 0;
}
