Cod sursa(job #2311618)
| Utilizator | Data | 3 ianuarie 2019 15:09:45 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,ap;
bool v[2000001];
int main()
{
fin>>n;
if(n<2)
{
fout<<0;
return 0;
}
v[1]=1;
for(int i=4; i<=n; i+=2)
v[i]=1;
for(int i=3; i*i<=n; i=i+2)
if(v[i]==0)
for(int j=i*i; j<=n; j=j+2*i)
v[j]=1;
for(int i=1; i<=n; ++i)
if(v[i] == 0)
ap++;
fout<<ap;
fin.close();
fout.close();
return 0;
}
