#include "iostream"\nusing namespace std;\n\nbool isPrime(int num) {\n if (num < 2) {\n return false;\n }\n for (int i = 2; i * i <= num; i++) {\n if (num % i == 0) {\n return false;\n }\n }\n return true;\n}\n\nint main() {\n int A, B;\n cin >> A >> B;\n int count = 0;\n for (int i = A; i <= B; i++) {\n if (isPrime(i)) {\n count++;\n }\n }\n cout << count << endl;\n return 0;\n}

GESP二级真题 C++ 编程题-1 找素数 - 2023年6月真题解析

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

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