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


原文地址: https://www.cveoy.top/t/topic/pBY4 著作权归作者所有。请勿转载和采集!

免费AI点我,无需注册和登录