#include <iostream> #include <vector> using namespace std; // 判断素数函数 bool isPrime(int num) { if (num <= 1) return false; for (int i = 2; i * i <= num; ++i) { if (num % i == 0) return false; } return true; } int main() { vector<int> primes; for (int i = 2; i <= 100; ++i) { if (isPrime(i)) primes.push_back(i); } for (int even = 6; even <= 100; even += 2) { for (int i = 0; i < primes.size(); ++i) { int first = primes[i]; int second = even - first; if (second >= first && isPrime(second)) { cout << even << "=" << first << "+" << second << endl; break; } } } return 0; }