// Programmieren 1, Praktikum 2, Aufgabe 4
// Sven Eisenhauer
// 05.11.2004
//
// file: prg1p2_4.cpp
//
// purpose: Program to find all prime numbers, which are smaller than the entered positive number
//          

#include <iostream>
#include <iomanip>

using std::cin;
using std::cout;
using std::endl;

int main()
{
	int iNumber=0;
	int iIsPrime=0;

	system ("cls");
	cout << "Please enter a positive number: ";
	cin >> iNumber;
	if (0 >= iNumber)  // handle wrong input in some way
	{
		cout << "Not a positive number!!!";
		system ("pause");
	}
	else // end error handler
	{  // let's begin
		for (int iOuterCounter=iNumber;iOuterCounter>1;iOuterCounter--)
		{  // decrement the number and check, if it is a prime (modulo any number is 0)
			iIsPrime=0; // we asume actual number is a prime
			for (int iInnerCounter=iOuterCounter-1;iInnerCounter>1;iInnerCounter--)
			{
				if ( 0 == iOuterCounter%iInnerCounter)
				{
					iIsPrime=1;  // actual number is NOT a prime
				}
			}// end inner for routine
			if (0 == iIsPrime)
				cout << endl << iOuterCounter;

		} // end outer for routine
		cout << endl;
		system ("pause"); // wait a moment for user to read

	} // end else
	return 0;
}// end main