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

#include <iostream>
using namespace std;
bool isprime(int num)
{
    for (int i = 2; i*i <= num; ++i)
    {
        if (num % i == 0)
        {
            return false;
        }
    }
    return true;
}
int main() {
    int even;
    cin >> even;
    if (isprime(even/2))
    {
        cout << even / 2 << endl;
        cout << even / 2 << endl;
    }
    else  
    {
        for (int i = 1; i <= even / 2 -2; ++i)
        {
            if (isprime(even / 2 - i) && isprime(even / 2 + i))
            {
                cout << even / 2 - i << endl;
                cout << even / 2 + i << endl;
                break;
            }
        }
    }
    return 0;
}