Pagini recente » Cod sursa (job #2331438) | Cod sursa (job #557776) | Cod sursa (job #2289348) | Cod sursa (job #333062) | Cod sursa (job #1757675)
#include<fstream>
using namespace std;
ifstream fi("ciur.in");
ofstream fo("ciur.out");
int n;
bool E[2000001];
int e(int n)
{
int nr=0,i,j;
for(i=1; ((i*i)<<1)+(i<<1)<=n; i++)
{
if(E[i]==0)
{
for (j=((i*i)<<1)+(i<<1); (j<<1)+1<=n; j+=(i<<1)+1)
{
E[j]=1;
}
}
}
for(i=1; 2*i+1<=n; i++)
if(E[i]==0)
nr++;
return nr+1;
}
int main()
{
fi>>n;
fo<<e(n)<<"\n";
fi.close();
fo.close();
return 0;
}