每日打卡

回文素数

问题描述：回文素数是数字以中间一个数或两个数成对称的素数，求1000以内的回文素数

问题分析：先用倒序数的方法判断是否为素数，再穷举出其中的回文数

代码：#include<stdio.h>

#include<math.h>

int fun(int n);

int main()

{

            int i,j,k,l,m;

            printf("不小于1000的回文数：\n");

            for(i=0;i<=9;++i)

              for(j=0;j<=9;++j)

                     for(k=0;k<=9;++k)

                     {

                            l=i*100+j*10+k;

                            m=k*100+j*10+i;

                            if(i==0&&j==0)

                            {

                                   m=m/100;

                            }

                            else if(i==0)

                            {

                                   m=m/10;

                            }

                            if(l>10&&l==m&&fun(l))

                            {

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

                            }

                     }

                     printf("\n");

}