/*
Lab exam winter semester 2016/2017.
Lecture: IE-B1-SO1 (Software construction 1)
*/
#define _CRT_SECURE_NO_DEPRECATE
#include <stdio.h>
#include <math.h>


typedef enum
{
	 FALSE, TRUE
}boolean;

/* Function prototypes */
int isEven(int number);
boolean isPrimeNumber(int number);
void printPrime(int number);

int main(void)
{
	int number;
	printf("Enter a positive integer: ");
	while ((scanf("%d", &number) == 0)||( number<=0 ))
	{
		printf("Invalid Input. Retry: ");
		while (getchar() == "/n")
			continue;
	}
	printPrime(number);
	getchar();
	getchar();
	getchar();

	return 0;
}

int isEven(int number)
{
	if (number % 2 == 0)
		return TRUE;
	else
		return FALSE;
}

boolean isPrimeNumber(int number)
{
	if (number <= 1)
	{
		return FALSE;
	}
	else if ((number >= 4) && (isEven(number) == 1))
	{
		return FALSE;
	}
	else
		for (int m = 3; m <= (number / 2); m = m + 2)
		{
			if (number%m == 0)
			{
				return FALSE;
			}
		}

	return TRUE;

}

void printPrime(int number)
{
	int printCount = 0;

	printf("Enter maximum number to test: %d\nPrime numbers in[1, %d]:\n", number, number);

	for (int i = 1; i <= number; i++)
	{
		if (isPrimeNumber(i) == TRUE)
		{
			printf("%-5d", i);
			printCount++;
		}
	}
	if (printCount % 10 == 0)
	{
		printf("\n");
	}

	printf("\nThere are %d prime numbers in [1, %d].", printCount, number);
}