哥德巴赫猜想验证：分解偶数为两个素数之和

#include\u003ciostream\u003e\n#include\u003cvector\u003e\nusing namespace std;\n\n// 判断一个数是否为素数\nbool isPrime(int num) {\n if (num \u003c 2) {\n return false;\n }\n for (int i = 2; i * i \u003c= num; i++) {\n if (num % i == 0) {\n return false;\n }\n }\n return true;\n}\n\n// 分解偶数为两个素数之和\nvector\u003cint\u003e decompose(int n) {\n vector\u003cint\u003e res;\n for (int i = 2; i \u003c= n / 2; i++) {\n if (isPrime(i) && isPrime(n - i)) {\n res.push_back(i);\n res.push_back(n - i);\n break;\n }\n }\n return res;\n}\n\nint main() {\n int n;\n cin >> n;\n\n vector\u003cint\u003e res = decompose(n);\n cout << n << "=" << res[0] << "+" << res[1] << endl;\n\n return 0;\n}