Pagini recente » Cod sursa (job #2549993) | Cod sursa (job #1031439) | Cod sursa (job #1658146) | Cod sursa (job #2178632) | Cod sursa (job #574311)
Cod sursa(job #574311)
#include <fstream>
#include <math.h>
using namespace std;
int main()
{
ofstream g ("ciur.out");
ifstream f ("ciur.in");
char p[2000005];
long n;
int nr=0;
float rad;
f>>n;
f.close();
for(int i=1;i<=n;i++) p[i]=0;
rad=sqrt(n);
for(int i=1;2*i+2*i<=rad;i++) //2*i+1
{
if(p[i]==0)
{
for(int j=2*i*i+2*i;2*j+1<=n;j+=2*i+1) p[j]=1;
}
}
for(int i=1;2*i+1<=n;i++) if(p[i]==0) nr++;
g<<nr;
g.close();
}