C语言实现：偶数分解为素数对，奇数特殊输出，输入 0 结束程序

```c #include <stdio.h> int isPrime(int n) { if (n <= 1) { return 0; } for (int i = 2; i * i <= n; i++) { if (n % i == 0) { return 0; } } return 1; } int main() { int num; printf("请输入一个整数: "); scanf("%d", &num); while (num!= 0) { if (num % 2 == 0) { int found = 0; for (int i = 2; i <= num / 2; i++) { if (isPrime(i) && isPrime(num - i)) { printf("%d=%d+%d\n", num, i, num - i); found = 1; break; } } if (!found) { printf("未找到分解的素数对\n"); } } else { printf("%d is odd number!\n", num); } printf("请输入一个整数: "); scanf("%d", &num); } return 0; } ``` ######[AI写代码神器 | 297点数解答 | 2024-10-14 20:12:30]