Cod sursa(job #1312916)
Utilizator | Data | 10 ianuarie 2015 09:43:51 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
#include <bitset>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bitset<2000001> v;
int main()
{
int n,i,j,sol,N=2000001;
fin>>n;
for(i=3;i*i<N;i+=2)
{
if(v[i]==0)
for(j=i*i;j<N;j=j+i) v[j]=1;
}
sol=1;
for(i=3;i<=n;i=i+2)
{
if(v[i]==0) sol++;
}
fout<<sol;
return 0;
}