提交时间:2026-04-10 15:24:50

运行 ID: 87043

#include <iostream> #include <cmath> using namespace std; bool isPrime(int num) { if (num < 2) return false; for (int i = 2; i <= sqrt(num); i++) { if (num % i == 0) return false; } return true; } int main() { for (int even = 6; even <= 100; even += 2) { for (int p = 2; p < even; p++) { if (isPrime(p) && isPrime(even - p)) { cout << even << "=" << p << "+" << even - p << endl; break; } } } return 0; }