判断一个正整数是否为质数的算法

#include <iostream>
#include "stdafx.h"

using namespace std;

int isPrime(long a)
{
	if (a < 0)
		return -1;
	else if (a == 1 || a == 2)
	{
		return 1;
	} 
	else if(a == 0)
	{
		return 0;
	}
	else
	{
		if ((a%2 == 0) || (a%3 == 0) || (a%5 == 0) || (a%7 == 0))
		{
			return 0;
		}

		else
			return 1;
	}
}

void main()
{
	int a;
	cout << "Input an integer:" << endl;
	cin >> a;
	if (isPrime(a) == 0)
	{
		cout << "The inputed number isn't a prime number" << endl;
	}
	else if (isPrime(a) == 1)
		cout << "The inputed number is a prime number" << endl;
	else
		cout << "Input again" << endl;
}