这道题的最普通做法

解题思路:

注意事项:

参考代码:

#include<stdio.h>

int sushu(int n) 检查是否为素数

{

int m = 0;

for (int i = 2; i < n; i++)

if (n % i == 0)

m++;

return m;

}

int huiwenshu(int p)//检查是否为回文数

{

int arr[10] = { 0 }, sum = 0, j = 0;

while (p)

{

arr[++sum] = p % 10;

p /= 10;

}

int op = sum;

for (int y = 1; y <= ( sum/ 2) ; y++)

if (arr[y] == arr[sum--])

j++;

return (j == op / 2) ? 1 : 0;

}

int main()

{

int n, m;

scanf("%d %d", &n, &m);

for (int l=n; l < m; l++)

if (sushu(l)==0)

if ( huiwenshu(l))

printf("%d\n", l);

return 0;

}