代码

//没带U盘
#include<bits/stdc++.h>
using namespace std;

const int N = 10000000;
bool su[10000000];
int count;
bool SushuJudge(int ab)
{
        if(su[ab - 1] == true)
        {
			return true;
        }
		else
		{
			return false;
		}
}

void sushu()
{
	for(int i = 0 ; i <= N ; i++)
	{
		su[i] = true;
	}
	su[0] = su[1] = su[2] = su[3] = su[4] = su[5] = su[6] = su[7] = su[8] = su[9] = false;
	for(int i = 10 ; i <= N ; i++) //从11开始往后筛
	{
		if(su[i])
		{
			for(int j = i + i ; j <= N ; j += i)
			{
				su[j] = false;
			}
		}
	}
}

bool isHWSS(int aaa)
{
	if(SushuJudge(aaa) == false)
	{
		return false;
	}
	else
	{
		int ttt , ttt2 = aaa;
		while(ttt2)
		{
			ttt *= 10;
			ttt += ttt2 % 10;
			ttt2 / 10;
		}
		if(aaa == ttt2)
		{
			return true;
		}
		else
		{
			return false;
		}
	}
}

int main()
{
    int a , b;
    cin>>a>>b;
    sushu();
	for(int i = a ; i <= b ; i++)
	{
		if(isHWSS(i) == true)
		{
			cout<<i<<" ";
		}
	}
}

评测结果