Pagini recente » Cod sursa (job #2719924) | Cod sursa (job #3153643) | Cod sursa (job #1051712) | Cod sursa (job #1488307) | Cod sursa (job #1684730)
#include <fstream>
using namespace std;
int n,i,tmp,j,nmax,k;
bool ciur2[1000001];
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
nmax=n/2;
for(int i = 1; i<=nmax; ++i)
{
if(ciur2[i] == 1) continue;
int tmp = 2*i+1;//
for(int j = tmp*tmp; j<=n; j+=tmp)
{
int tmp2 = j/2;
ciur2[tmp2] = 1;
}
}
for(int i=1;i<=nmax;i++)
if(ciur2[2*i+1]==0)
k++;
g<<k;
}