Cod sursa(job #2559196)
| Utilizator | Data | 27 februarie 2020 09:27:19 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include<iostream>
#include<fstream>
#include<cmath>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
#define M 2000005
bool ap[M];
int n;
void ciur()
{
ap[1]=1;
ap[0]=1;
int r=sqrt(M);
for(int i=2; i<=r; i++)
{
if(ap[i]==0)
{
for(int j=i+i; j<=M; j=j+i)
{
ap[j]=1;
}
}
}
}
int main ()
{
int c=0;
fin>>n;
ciur();
for(int i=1;i<=n;i++)
{
if(ap[i]==0)
{
c++;
}
}
fout<<c;
fin.close();
fout.close();
return 0;
}
