检查是否为回文数:
bool check(int x)
{
int a[20], flag = 1;
while (x > 0)
{
a[flag] = x % 10;
x /= 10;
flag++;
}
for (int i = 1; i <= flag / 2; i++)
if (a[i] != a[flag - i])
return 0;
return 1;
}
检查是否为质数:
bool check2(int x)
{
if (x == 2) return 1;
for (int i = 2; i <= sqrt(x); i++)
if (x % i == 0)
return 0;
return 1;
}