//Xinnuo Wang                   CS1A                   Chapter6 Page.375 #22
/*******************************************************************************
 * 
 * Determine intergers is prime
 * _____________________________________________________________________________
 * The program determines a list of integers which from 1 to 100 prime or not  .
 * 
 * _____________________________________________________________________________
 * Input
 *    num    : The list of integers
 * Output
 *    t      : True, reperesent the interger is prime
 *    f      : Fslse,reperesent the interger isn't prime
 * ****************************************************************************/
#include <iostream>
using namespace std;
bool isPrime(int num);
int main() 
{
	for (int num = 1; num< 100; num++)
	{
	    cout << num<< " is prime or not: " << isPrime(num) << endl;
	}
	return 0;
}
bool isPrime(int num)
{
	for (int i = 2; i< num; i++)
	{
		if (num % i == 0)
		return false;
	}
	return true;
 
}