Cod sursa(job #1333863)
Utilizator | Data | 3 februarie 2015 17:28:29 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
#include <bitset>
#include <cmath>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n;
bitset<200000002> v;
int ciur(int n)
{
int rez=1, rad=sqrt(n), i;
for(i=3; i<=rad; i=i+2)
if(v[i]==0)
{
rez++;
for(int j=i*i; j<=n; j=j+i+i)
v[j]=1;
}
for(;i<=n;i=i+2)
if(v[i]==0)
rez++;
return rez;
}
int main()
{
fin>>n;
fout<<ciur(n);
return 0;
}