026.穷举法验证哥德巴赫猜想:任一大于6的数字都可以被拆分为两个素数之和

#include<iostream> 

using namespace std;

int isPrime(int n) {		//判断是否是素数 
	int i;
	if (n == 1)
		return 1;
	else {
		for (i = 2; i < n; i++)
			if (n % i == 0) return 0;
		return 1;
	}
}

int main() {
	int num;
	cin >> num;	//输入数
	while ((num % 2 != 0) || (num < 6)) {//判断数字是否满足要求 
		cout << "Error! Please enter another num" << endl;
		cin >> num;
	}
	for (int i = 1; i < num; ++i) {
		for (int j = 1; j < i; ++j) {
			if (((i + j) == num) && isPrime(i) && (isPrime(j)))
				cout << i << "+" << j << "=" << num << endl;
		}
	}
	return 0;
}