Cod sursa(job #1930044)
| Utilizator | Data | 18 martie 2017 14:31:46 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
#include <math.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int v[2000005];
void ciur()
{
int n=2000005;
int lim,i,j;
lim=(int)sqrt((double)n);
for(i=4;i<=n;i=i+2)
v[i]=1;
for(i=3;i<=lim;i=i+2)
{
if(v[i]==0)
{
for(j=i*i;j<=n;j=j+(i*2))
v[j]=1;
}
}
}
int main()
{
int n,sol,i;
ciur();
sol=1;
fin>>n;
for(i=3;i<=n;i+=2)
if(v[i]==0)
sol++;
fout<<sol<<"\n";
fin.close();
fout.close();
return 0;
}
