Pagini recente » Cod sursa (job #3141519) | Cod sursa (job #2019626) | Statistici Ben Swolo (ben_swolo) | Cod sursa (job #773262) | Cod sursa (job #1750595)
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
#define dim 1000001
long long int n,sir[dim*2],i,j,k=1;
int main()
{
fin>>n;
for (i = 1; ((i * i) << 1) + (i << 1) <= n; i=i+1)
{
if (sir[i] == 0)
{
for (j = ((i * i) << 1) + (i << 1); (j << 1) + 1 <= n; j=j+(i << 1) + 1)
{
sir[j] = 1;
}
}
}
for (i=1; 2 * i + 1 <= n; i++)
if (sir[i] == 0)
k++;
fout<<k;
return 0;
}