组合题5 个小题
已作答 0 / 5
1#include <iostream>2using namespace std;3 4bool isPrime(int n) {5 if (n <= 1) {6 return false;7 }8 for (int i = 2; i * i <= n; i++) {9 if (n % i == 0) {10 return false;11 }12 }13 return true;14}15 16int countPrimes(int n) {17 int count = 0;18 for (int i = 2; i <= n; i++) {19 if (isPrime(i)) {20 count++;21 }22 }23 return count;24}25 26int sumPrimes(int n) {27 int sum = 0;28 for (int i = 2; i <= n; i++) {29 if (isPrime(i)) {30 sum += i;31 }32 }33 return sum;34}35 36int main() {37 int x;38 cin >> x;39 cout << countPrimes(x) << " " << sumPrimes(x) << endl;40 return 0;41}如果将 for (int i = 2; i * i <= n; i++) 改为 for (int i = 2; i <= n; i++),输入 10 时,程序的输出( )。