博客

C语言 求1000以内的回文素数

  • Post author:
  • Post category:其他



#include <stdio.h>

#include <stdlib.h>

int


main()

{



int


i,j,t,k,s;



printf


(


"Following are palindrome primes not greater than 1000:\n"


);



for


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

{



for


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

{



for


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



{

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



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



if


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



t/=100;



else


if


(i==0)



t/=10;



if


(s>10&&s==t&&a(s))



printf


(


"%d\t"


,s);
}



}

}

}

a(n)

{

int


n;



int


i;

for


(i=2;i<=(n-1)/2;i++)



if


(n%i==0)



return


(0);



return


(1);

}

Following are palindrome primes not greater than 1000:11 101 131 151 181 191 313 353 373 383 727 757 787 797 919 929


版权声明：本文为sunyueqinghit原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。