回文数和回文素数

"回文数"是一种数字。如：98789, 这个数字正读是98789,倒读也是98789,正读倒读一样，所以这个数字就是回文数

1千以内

在自然数中，最小的回文数是0，其次是1,2,3,4,5,6,7,8,9,11,22,33,44,55,66,77,88,99,101,111,121,131,141,151,161,171,181,191,202,212,222,232,242,252,262,272,282,292,303,313,323,333,343,353,363,373,383,393,404,414,424,434,444,454,464,474,484,494,505,515,525,535,545,555,565,575,585,595,606,616,626,636,646,656,666,676,686,696,707,717,727,737,747,757,767,777,787,797,808,818,828,838,848,858,868,878,888,898,909,919,929,939,949,959,969,979,989,999.

源码如下：

#include<iostream>
using namespace std;
int prime(int n)
{
	if(n <= 0) return 0;
	for (int i = 2; i < n; i++)
	{
		if (n%i == 0)
		return 0;
	}
	return 1;
}

long proc(long m)
{
	
	long temp = m,n=0;
	while (temp)
	{
		n = n*10+temp%10;
		temp = temp/10;
	}
	if(m == n)
		return n;
	else 
		return 0;
}
int main()
{
	cout<<"1—100以内的回文数："<<endl;
	for (int i = 0; i < 1000; i++)
	{
		int a = proc(i);
		if(a > 0 )
		{
			cout<<a<<" ";
		}	
	}
	cout<<endl<<endl;
	
	cout<<"1—1000以内的回文素数："<<endl;
	for (int i = 0; i < 1000; i++)
	{
		int b = proc(i);
		if(b > 0 && prime(b))
		{
			cout<<b<<" ";
		}	
	}
	cout<<endl;
	system("pause");
	return 0;
}

结果如下：