88pts,最后一个测试点1.00sTLE

#include<bits/stdc++.h>
#define sortqueue_greater priority_queue<int,vector<int>,greater<int> >
#define sortqueue_less priority_queue<int>
#define inl inline
#define reg register
#define int long long
#define lll __int128
#define rep(i,x,y) for(reg int i=x;i<=(y);++i)
#define per(i,x,y) for(reg int i=x;i>=(y);--i)
#define rpr(i,x,y,z) for(reg int i=x;i<=(y);i+=z)
#define epe(i,x,y,z) for(reg int i=x;i>=(y);i-=z)
#define repe(i,x,y) for(i=x;i<=(y);++i)
#define endl '\n'
#define INF 1e16
#define pb push_back
#define pob pop_back
#define pf push_front
#define pof pop_front
#define fi first
#define se second
#define lcm(x,y) x/__gcd(x,y)*y
#define ull unsigned long long
#define prr make_pair
#define pii pair<int,int>
#define gt(s) getline(cin,s)
#define at(x,y) for(reg auto x:y)
#define ff fflush(stdout)
#define mt(x,y) memset(x,y,sizeof(x))
#define idg isdigit
#define gc getchar
#define pc putchar
#define fp(s) string ssss=s;freopen((ssss+".in").c_str(),"r",stdin);freopen((ssss\
        +".out").c_str(),"w",stdout);
#define sstr stringstream
#define all(x) x.begin(),x.end()
#define mcy(a,b) memcpy(a,b,sizeof(b))
#define ui unsigned
#define si signed
#define eb emplace_back
#define pff(x) (x)*(x)
using namespace std;
inl int in() {
	reg int f=1,x=0;
	reg char ch=gc();
	while(!idg(ch)) {
		if(ch=='-') f=-1;
		ch=gc();
	}
	while(idg(ch)) {
		x=(x<<1)+(x<<3)+(ch^'0');
		ch=gc();
	}
	return f*x;
}
inl void out(int x) {
	if(x<0) {
		pc('-');
		x=-x;
	}
	if(x>=10) out(x/10);
	pc(x%10^'0');
}
inl bool zs(int x){
	if(x<=1){
		return false;
	}
	for(int i=2;i*i<=x;i++){
		if(x%i==0){
			return false;
		}
	}
	return true;
}
signed main(){
	int a=in(),b=in(),c,ge=0;
	for(reg int i=a;i<=b;++i){
		c=i;
		ge=0;
		while(c!=0){
			ge=ge*10+c%10;
			c/=10;
		}
		if(ge==i){
			if(zs(i)){
				printf("%d\n",i);
			}
		}
	}
	return 0;
}