// 
// prmbnch.cpp -- simple benchmark platform for testing prime counting
//                methods.
//
#include <iostream.h>
#include <math.h>
#include <time.h>

//
// Slight modification of Bau's method.
//
long cbpi(long x)
{
	long i,j,k,sum;

	if (x < 5) return 2*x/3;
	for (i = 5,sum = 2;i <= x;i += 2,sum += k)
	{
		for (j = 3,k = 1;j*j <= i; j+=2)
		{
			if (i % j) continue;
			else
			{
				k = 0;
				break;
			}
		}
	}
	return sum;
}

unsigned long long pi(unsigned long long x) { return cbpi(x); }