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

#include <iostream>
#include <vector>
using namespace std;

int main() {
  vector<int> shushu = {1,2,3};
  for(int i = 4 ; i <=1000 ; i++){
    int count = 0;
    int time = 0;
    for(int k = 2 ; k < i ; k++){
        time++;
        if( i % k != 0) count++;
    }
    if(time == count) shushu.push_back(i);
  }

    int n;
    cin >> n;
    int a1,a2;
    int b1,b2;
    int min = 1000;
    for(int i ; i < shushu.size() ; i ++){
        a1 = shushu[i];
        for(int j = i ; j < shushu.size() ; j++){
            a2 = shushu[j];
            if(a1+a2 == n){
                if(a2 - a1 < min) {
                min = a2-a1;
                b1 = a1 ; b2 = a2;  
                }
            }
        }
    }
    cout << b1 << endl << b2 << endl;
    return 0;


}
// 64 位输出请用 printf("%lld")