Pagini recente » Cod sursa (job #3128324) | Cod sursa (job #513799) | Cod sursa (job #2877610) | Cod sursa (job #272499) | Cod sursa (job #2189788)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
const int N=100000000/2+1;
char c[N];
int n;
inline int ciur(int n)
{
int i,j,nr=1;
for(i = 1; ((i * i) << 1) + (i << 1) <= n; ++i)///((i*i)<<1) <=> 2*i+1 ; daca 2*i+1 e prim=>multiplii pana la n vor fi 1
{
if((c[i>>3]&(1<<(i&7)))==0) ///daca 2*i+1 e prim
{
for(j=((i * i) << 1) + (i << 1); (j << 1) + 1<=n; j+=(i << 1) + 1)
{
c[j >> 3]|=(1 << (j & 7));
}
}
}
for(i=1; 2 * i + 1<=n; ++i)
if((c[i>>3]&(1<<(i&7)))==0)nr++;
return nr;
}
int main()
{
fin>>n;
fout<<ciur(n);
return 0;
}