```c #include <stdio.h> #include <math.h> int isPrime(int n) { if (n < 2) return 0; for (int i = 2; i <= sqrt(n); i++) { if (n % i == 0) return 0; } return 1; } int main() { int n; while (scanf("%d", &n)!= EOF) { int count = 0; int num = 2; while (num <= n) { if (isPrime(num)) count++; if (num == n && isPrime(num)) { printf("%d\n", count); break; } num++; } if (num > n ||!isPrime(n)) printf("0\n"); } return 0; } ``` [2024-11-18 21:30:05 | AI写代码神器 | 207点数解答]