Cod sursa(job #1968370)
Utilizator | Data | 17 aprilie 2017 17:29:51 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
#include <bitset>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
const int nmax=2000005;
bitset<nmax>v;
int ciur(int n)
{
int i,j;
for(i=3;i*i<=n;i+=2)
{
if(v[i]==0) for(j=i*i;j<=n;j+=i) v[j]=1;
}
int nr=1;
for(i=3;i<=n;i+=2)
{
if(v[i]==0) nr++;
}
return nr;
}
int main()
{
int n;
fin>>n;
fout<<ciur(n);
}