题目链接

源代码

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
bool flag[1000000005];
void generate_primes()
{
	memset(flag, true, sizeof(flag));
    flag[0] = flag[1] = false; 
    for (int i = 2; i <= 1000000000; i++)
    {
        if (flag[i]) 
        { 
        	for (int j = 2; j <= 1000000000 / i; j++)
            {
                flag[i * j] = false;
            }
        }
    }
}


bool palindromes_detect(int number)  
{   
	int n = 0;
	int m = number; 
	while(m != 0)  
	{  
		n = n * 10 + m % 10;
		m = m / 10;  
	}  
	return n == number; 
}  


int main()
{
	generate_primes();
	int start, end;
	cin >> start >> end;
	for (int i = start;i <= end;i++)
	{
		if (palindromes_detect(i))
		{
			cout << i << endl;
		}
	}
	return 0;
}

谢谢！