Finding Prime numbers without using Boolean

[jonnymac5987]

Here is a program which finds prime numbers, but because the compiler i need to use for my class does not use a boolean variable i am having trouble figuring this out. Please help me find how to find prime numbers without using a boolean variable.

#include <iostream>
using namespace std;
void prime_num(int);
int main()
{
cout << " Enter a number and I will generate the prime numbers up to that number: ";
int num = 0;
cin >> num;
prime_num(num);
}
 
void prime_num( int num)
{
  bool isPrime=true;
  for ( int i = 0; i <= num; i++)
  {
    for ( int j = 2; j <= num; j++)
    {
      if ( i!=j && i % j == 0 )
      {
        isPrime=false;
        break;
      }
    }
    if (isPrime)
    {
      cout <<"Prime:"<< i << endl;
    }
    isPrime=true;
  }
}

[Infarction]

Why not just use an int? Let 0 be false and anything else be true, like in C.

Also, please learn to use [code] and [/code] tags when you post, so we can read your code.