Cod sursa(job #1441335)
Utilizator | Data | 24 mai 2015 08:20:06 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
#include <bitset>
#define MAX 2000003
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bitset <MAX> v;
int ciur(int n)
{
int nr=1,i,j;
for(i=3;i*i<=n;i=i+2)
if(v[i]==0)
for(j=i*i;j<=n;j=j+i+i)
v[j]=1;
for(i=3;i<=n;i+=2)
if(v[i]==0)
nr++;
return nr;
}
int main()
{
int n;
fin>>n;
fout<<ciur(n);
}