区间内的真素数OpenJudge1.13编程基础之综合应用-23

#include<iostream>
#include<cmath>
bool isPrime(int x)
{
	for (int i = 1;i <= (int)sqrt(x);i++)
	{
		if (x%i == 0 && i != 1)
			return false;
	}
	if (x == 1)
	{
		return false;
	}
		return true;
}
int flip(int x)
{
	int a[5];
	int i,sum=0;
	for (i = 1;i <= 5;i++)
	{
		if (x % (int)pow(10, i) == x)
			break;
	}
	for (int j = 0;j < i;j++)
	{
		a[j] = (x % (int)pow(10, j + 1) / (int)pow(10, j))*(int)pow(10, i - j - 1);
		sum += a[j];
	}
	return sum;
}
int b[100000];
using namespace std;
int main()
{
	int m, n,flag=0;
	cin >> m >> n;
	for (int i = m;i <= n;i++)
	{
		if (isPrime(i) && isPrime(flip(i)))
		{
			b[flag] = i;
			flag++;
		}
	}
	if (flag)
	{
		for (int i = 0;i < flag - 1;i++)
		{
			cout << b[i] << ",";
		}
		cout << b[flag - 1] << endl;
	}
	else
		cout << "No" << endl;
	return 0;
}