Cod sursa(job #1275922)
Utilizator | Data | 25 noiembrie 2014 19:45:02 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
#include <bitset>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
const int N=2000001;
bitset<N> v;
inline int ciur(int n)
{
int i,j;
for(i=3;i*i<N;i+=2)
{
if(!v[i])
{
for(j=i*i;j<N;j+=i) v[j]=1;
}
}
int sol=1;
for(i=3;i<n;i+=2)
{
if(!v[i])
{
sol++;
}
}
if(n==0) return 0;
else return sol;
}
int main()
{
int n;
fin>>n;
fout<<ciur(n);
}