描述
输入部分因为过于没做处理,读者自行补充
代码
#include <iostream>
#include <vector>
using namespace std;
int isPalind(int n) {
for (int i = 2; i < n; ++i) {
if (n % i == 0) {
return 0;
}
}
return 1;
}
vector<int> palindSet(int n) {
vector<int> res;
for (int i = 2; i < n; ++i) {
if (isPalind(i)) {
res.push_back(i);
}
}
return res;
}
void show(int n) {
vector<int> res = palindSet(n);
int PalindA = 0, PalindB = 0, distance = n;
for (int i = 0; i < res.size(); ++i) {
for (int j = i + 1; j < res.size(); ++j) {
if ((res[i] + res[j] == n) && (abs(res[i] - res[j]) < distance)) {
PalindA = res[i];
PalindB = res[j];
distance = abs(res[i] - res[j]);
}
}
}
cout << PalindA << " " << PalindB << endl;
}
int main() {
show(20);
show(30);
return 0;
}