section 1.5.2

这道题就是一个回文数和一个素数的判断问题，为了提升效率，可以先将回文数表示出来，再进行判断该数是否是素数即可。代码如下。

#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
int a=0,b=0;
int judge(int s){
	if (s<a||s>b){
		return 0;
	}
	int k=0;
	k=sqrt(s);
	int i=0;
	for (i=2;i<=k;i++){
		if (s%i==0){
			break;
		}
	}
	if (i>=k+1){
		return 1;
	}
	else{
		return 0;
	}
}
int main (){
	freopen ("pprime.in","r",stdin);
	freopen ("pprime.out","w",stdout);
	int i=0;
	cin>>a>>b;
	int x1=0,x2=0,x3=0,x4=0;
	int palin=0;
	for (x1=a;x1<10;x1++){
		if (x1%2!=0&&judge(x1)){
			cout<<x1<<endl;
		}
	}
	palin=11;
	if (palin>=a&&palin<=b){
		cout<<palin<<endl;
	}
	for (x1=1;x1<=9;x1+=2){
		if (x1==5){
			continue;
		}
		for (x2=0;x2<=9;x2++){
			if ((2*x1+x2)%3==0){
				continue;
			}
			palin=x1*100+x2*10+x1;
			if (judge(palin)){
				cout<<palin<<endl;
			}
		}
	}
	for (x1=1;x1<=9;x1+=2){
		if (x1==5){
			continue;
		}
		for (x2=0;x2<=9;x2++){
			for (x3=0;x3<=9;x3++){
				if ((2*(x1+x2)+x3)%3==0){
					continue;
				}
				palin=x1*10000+x2*1000+x3*100+x2*10+x1;
				if (judge(palin)){
					cout<<palin<<endl;
				}
			}	
		}
	}
	for (x1=1;x1<=9;x1+=2){
		if (x1==5){
			continue;
		}
		for (x2=0;x2<=9;x2++){
			for (x3=0;x3<=9;x3++){
				for (x4=0;x4<=9;x4++){
					if (((x1+x2+x3)*2+x4)%3==0){
						continue;
					}
					palin=x1+x2*10+x3*100+x4*1000+x3*10000+x2*100000+x1*1000000;
					if (judge(palin)){
						cout<<palin<<endl;
					}
				}
			}
		}
	}
	return 0;
}