Cod sursa(job #1155418)
Utilizator | Data | 26 martie 2014 21:35:05 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
#include <bitset>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bitset <2000003> v;
int main()
{
int sol=1,i,j,N;
fin>>N;
for(i=3;i*i<N;i+=2)
{
if(!v[i])
{
for(j=i*i;j<N;j+=i)
{
v[j]=1;
}
}
}
for(i=3;i<=N;i+=2)
{
if(!v[i])
{
sol++;
}
}
if(N>1) fout<<sol;
else fout<<0;
}