Pagini recente » Cod sursa (job #447591) | Cod sursa (job #366327) | Cod sursa (job #882336) | Cod sursa (job #2267159) | Cod sursa (job #1138298)
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
long n;
bool pr[1000001];
long long ciur()
{
long i, j;
long long nr = 1;
for(i = 1; ((i * i) << 1) + (i << 1) <= n; i += 1)
{
if(pr[i] == 0)
{
for(j = ((i * i) << 1) + (i << 1); (j << 1) + 1 <= n; j += (i << 1) + 1)
{
pr[j]=1;
}
}
}
for(i = 1; (i << 1) + 1 <= n; ++i)
if(pr[i] == 0)
nr++;
return nr;
}
int main()
{
f >> n;
g << ciur();
}