```c #include <stdio.h> #include <stdbool.h> bool isPrime(int n) { if (n <= 1) { return false; } for (int i = 2; i * i <= n; i++) { if (n % i == 0) { return false; } } return true; } void decompose(int num) { if (num % 2 == 0) { for (int i = 2; i < num; i++) { if (isPrime(i) && isPrime(num - i)) { printf("%d=%d+%d\n", num, i, num - i); return; } } } else { printf("%d is odd number!\n", num); } } int main() { int num; scanf("%d", &num); while (num!= 0) { decompose(num); scanf("%d", &num); } return 0; } ``` [2024-10-17 21:38:10 | AI写代码神器 | 255点数解答]