#include <iostream>
#include <iomanip>
#include <cmath>
 
using namespace std;
 
// funtions
bool isPrime (long num);          
// Returns true if n is a prime, else false
long primeCount (long x, long y);
 // Returns the number of primes between x and y, inclusive.
int main()
{
// create a loop that calls primeCount(x,y) to test 1000 numbers at a time
 /*
use the value returned from primeCount to output results
 
// end of the loop
// output final statistics
}
 
longprimeCount (long x, long y)
{
// loop through all of the thousand numbers
// call isPrime to check each number
// some kind of logic to deal with the result of isPrime
// return how many primes found between x and y
}
 
bool isPrime (long num)
{
// determine if num is a prim number
// return true if it is
// return false if it is not
}
 
 
bool isPrime(int n)
{
    if((n == 0)||(n == 1))
        return false;
        
    int factors = 2;
    numPrimes++
            
    for(int i=2; i<=((int)sqrt((double)n)); i++){
        if(n%i == 0){
            factors++;
            break;
        }
    }
            
    if(factors == 2)
        return true;
    
   return false;
}
 

 
#include <iostream>
#include <iomanip>
#include <cmath>
using namespace std;
 
bool isPrime(long n);
long primeCount (long x, long y);
 
int main ()
{
	int i, counter =0;
	bool test;
    char reply;
 
 
    cout << "Start" <<setw(6) << "End" << setw(24) << "Number of Primes" << endl;
 
 
 
        primeCount ( 1, 1000);
 
        cout << 1<< setw(6) << 1000 << setw(24) << counter << endl;  
 
 
 
 
 
 
    cout << "Press 'q' followed by 'Enter' to quit: ";
    cin >> reply;
 
    return 0;
 
}
 
long primeCount (long x, long y)
{
     int i = 0, counter = 0;
     bool test;
 
     for (i = x; i <= y; i++ )
	 {
        test = isPrime(i);
		if ( test == true )
		{
		   counter++;
		}
 
}}
 
bool isPrime (long n)
{
 int j, num;
 
 if(num <= 1)
 return false;
 
 for ( j = 2; j*j <= num; j++ )
 
 
	if (num%j == 0)
 
	return false; 
 return true;
 
 
 }

#include <iostream>
#include <iomanip>
#include <cmath>
using namespace std;
 
bool find_prime(long);
long primeCount (long x, long y);
 
int main ()
{
	int counter, total;
 
   cout << "Start" <<setw(6) << "End" << setw(24) << "Number of Primes" << endl;
 
   primeCount (0 , 50000);
 
 
   cout << "Total primes in the first 50 chiliads:" << total << endl;
 
    cout << "Average number per chiliad:" << counter/1 << endl;
    system("pause");
}
 
long primeCount (long x, long y)
{
    int i, counter =0, total = 0;
	bool test; 
 
    for ( int k = x; k < y; k += 1000)
{
   for (i =1; i < 1000; i++ )
   {
	test = find_prime(i+k);
   	if ( test == true )
	{
	    counter++;
	    total += counter;
	}
   }
   cout << i+k-999 <<setw(10) << i+k << setw(12) << counter << endl;
   counter = 0;
 }}
 
bool find_prime (long num)
{
 int j;
 
 if(num <= 1)
 return false;
 
 for ( j = 2; j*j <= num; j++ )
 
 
	if (num%j == 0)
 
	return false; 
 return true;
 
 
 }