// This program prints a list of prime numbers from
// 1 to 100.

#include <iostream>
#include <math.h>

int main()
{
	int p;
	int i;
	int stopval;
	bool done;

	for (p = 1; p <= 100; ++p)
    {
		stopval = int(sqrt(p) + .5);

		// DECIDE IF IT IS A PRIME
		done = false;

		// could also do this
		// for (i=stopval; i>1 && !done; --i)
		for (i=2; i<=stopval && !done; ++i)
		{
			// can p be divided by i with no remainder
			if (p % i == 0)
				done = true;
		}
		if (!done)
			cout << p << " is prime" << endl;
	}
}