Pagini recente » Cod sursa (job #1817773) | Cod sursa (job #447380) | Cod sursa (job #936513) | Cod sursa (job #1430028) | Cod sursa (job #767923)
Cod sursa(job #767923)
#include <fstream>
#include <math.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int ciur ( int );
long long a[649861];
int main()
{
int n,x,i;
fin>>n;
fout<<ciur (n);
//fout<<v[n+1]*v[n+1];
return 0;
}
int ciur ( int n )
{
int i,j,nr=1,k=1;
//v[k++]=2;
for (i=1;(i<<1)+1<=n;i++)
{
if (a[i]==0)
{
//v[k++]=2*i+1;
nr++;
for(j=i+i+i+1;(j<<1)+1<=n;j+=(i<<1)+1)
a[j]=1;
}
}
return nr;
}