blu / euclid Goto Github PK

#define TRUE 1
#define FALSE 2
#define ERR 3

int crunch_results( int results )
{
	unsigned long long ctr;

	if ( results == 2 )
	{
		return TRUE;
	}
	else if ( results > 2 )
	{
		return FALSE;
	}
	else
	{
		return ERR;
	}
}

#define TRUE 1
#define FALSE 2
#define ERR 3

extern int crunch_results( int );

int prime_crunch( unsigned long long nbr )
{
	unsigned long long ctr;
	int results = 0;
	int result = 0;

	for ( ctr = 1; ctr <= nbr; ctr++ )
	{
		if ( nbr > 2 && (nbr % 2) == 0 )
		{
			return FALSE;
		}
		else if ( (nbr % ctr) == 0 )
		{
			results++;
		}
	}

	result = crunch_results(results);
	return result;
}

#include <stdio.h>

extern int prime_crunch( unsigned long long );

#define TRUE 1
#define FALSE 2
#define ERR 3

int main()
{
	int result;
	unsigned long long ctr, nbr;

	for( ctr = 1;; ctr++ )
	{
		nbr = ctr;
		result = prime_crunch(nbr);
		if ( result == TRUE )
		{
			printf("%llu is a prime number\n", nbr);
		}
		else if ( result == FALSE )
		{
			printf("%llu is not a prime number\n", nbr);
		}
		else if ( result == ERR )
		{
			printf("%llu is neither prime nor composite\n", nbr);
		}
		else
		{
			printf("Error in line %lu\n", __LINE__);
			return ERR;
		}
	}
	return ERR + 1;
}