C++ 判断质数或合数 - 代码示例和优化

#include \n#include \nusing namespace std;\n\nbool isPrime(int n) {\n if (n <= 1) {\n return false;\n }\n int sqrtN = sqrt(n);\n for (int i = 2; i <= sqrtN; i++) {\n if (n % i == 0) {\n return false;\n }\n }\n return true;\n}\n\nint main() {\n int n;\n cin >> n;\n if (isPrime(n)) {\n cout << "prime_number" << endl;\n } else {\n cout << "composite_number" << endl;\n }\n return 0;\n}