题解 | #HJ60 查找组成一个偶数最接近的两个素数#

#include <stdio.h>
#include <stdbool.h>

bool isPrime(int x) {
    if (x > 1) {
        for (int i = 2; i * i <= x; ++i) {
            if (x % i == 0) {
                return false;
            }
        }
        return true;
    } else {
        return false;
    }
}

int main() {
    int number;
    while (scanf("%d", &number) != EOF) {
        int start = number/2;
        for (int i=start; i>=2; i--) {
            if (isPrime(i) && isPrime(number-i)) {
                printf("%d\n%d\n", i, number-i);
                break;
            }
        }
    }
    return 0;
}