class Solution {
public:intprimePalindrome(int N){if(8<= N && N <=11)return11;for(int x =1; x <100000;++x){
string s =to_string(x),r(s.rbegin(), s.rend());
cout<<s<<" ";
cout<<r<<endl;int y =stoi(s + r.substr(1));if(y >= N &&isPrime(y))return y;}return-1;}
bool isPrime(int num){if(num <2|| num %2==0)return num ==2;for(int i =3; i * i <= num; i +=2)if(num % i ==0)return false;return true;}};
偶数位的回文数都是11的倍数,我也不知道咋的出来的结论最大的数10^8,那么就用1~99999,然后再反向拼接出来,最大可到10^9那么大的数class Solution {public: int primePalindrome(int N) { if (8 <= N && N <= 11) return 11; for (int x = 1; x < 100000; ++x) { string s .