求回文素数

1回文素数的定义就是,一个素数, 无论从左到右读,还是从右往左读,他都是同一个数,比如 2, 11 等等

 

回文素数有以下规律

当位数为1时有:

2 3 5 7

当位数为2的时候,仅仅有一个数:

11

当数是4,6,8....2n+2 (n=1,2,3.....)没有该回文素数,因为这些数都可以被11整除

 

以下代码为求1<=n <=9  位数的回文数求发:

 

1. #include <stdio.h>
2. #include <math.h>
3. #include <string.h>
5. bool isprime(int n)
6. {
7.     if (n<2)
8.     {
9.         return false;
10.     }
11.     else
12.     {
13.         for (register int i=2; i<=(int)sqrt(n); i++)
14.         {
15.             if (n%i == 0)
16.             {
17.                 return false;
18.             }
20.         }
22.         return true;
23.     }
24. }
26. void initprime(int data[], int num)
27. {
28.     int flag = 0;
29.     data[0]=1;
30.     data[1]=2;
32.     for (int i=3; i<num; i++)
33.     {
34.         flag = 0;
35.         for (int j=1; data[j]*data[j]<=i;j++)
36.         {
37.             if (i%data[j] == 0)
38.             {
39.                 flag =1;
40.                 break;
41.             }
42.         }
43.         if (flag == 0)
44.         {
45.             data[0]++;
46.             data[data[0]] = i;
47.         }
48.     }
49. }
51. int main()
52. {
54.     int num;
55.     int data[5200];
56.     int prime[10000];
57.     int count=0;
58.     int tempdata = 0;
59.     int flag = 0;
61.     initprime(prime,100000);
62. //    printf("%d",prime[0]);
65.     while (scanf("%d", &num) != EOF)
66.     {
67.         count = 0;
68.         if (num==1)
69.         {
70.             printf("4/n2 3 5 7/n");
71.             continue;
72.         }
73.         else if (num == 2)
74.         {
75.                printf("1/n11/n");
76.                continue;
77.         }
78.         else if (num%2 == 0)
79.         {
80.               printf("0/n");
81.               continue;
82.         }
83.         else if (num == 3)
84.         {
86.             for (int i=1; i<10; i+=2)
87.             {
88.                 if (i==5)
89.                     continue;
90.                 for (int j=0; j<10; j++)
91.                 {
92.                     tempdata = i*101+j*10;
94.                     for (int s=1; prime[s]*prime[s] <=tempdata; s++)
95.                     {
96.                         flag = 0;
98.                         if (tempdata%prime[s] == 0)
99.                         {
100.                             flag = 1;
101.                             break;
102.                         }
103.                     }
106.                     if ( flag == 0)
107.                     {
109.                          data[count++] = tempdata;
110.                     }
111.                 }
112.             }
113.         }
114.         else if (num == 5)
115.         {
116.             for (int i=1; i<10; i+=2)
117.             {
118.                 if (i==5)
119.                 continue;
121.                 for (int j=0; j<10; j++)
122.                 {
123.                     for (int k=0; k<10; k++)
124.                     {
125.                         tempdata = i*10001+j*1010+k*100;
126.                         for (int s=1; prime[s]*prime[s] <=tempdata; s++)
127.                         {
128.                             flag = 0;
129.                             if (tempdata%prime[s]  == 0)
130.                             {
131.                                 flag = 1;
132.                                 break;
133.                             }
134.                         }
136.                         if ( flag == 0)
137.                         {
138.                             data[count++] = tempdata;
139.                         }
140.                     }
141.                 }
142.             }
143.         }
144.         else if (num == 7)
145.         {
146.             for (int i=1; i<10; i+=2)
147.             {
148.                 if (i==5)
149.                 continue;
151.                 for (int j=0; j<10; j++)
152.                 {
153.                     for (int k=0; k<10; k++)
154.                     {
155.                         for (int l=0; l<10; l++)
156.                         {
157.                             tempdata = i*1000001+j*100010+k*10100+l*1000;
158.                             for (int s=1; prime[s]*prime[s] <=tempdata; s++)
159.                             {
160.                                 flag = 0;
161.                                 if (tempdata%prime[s]  == 0)
162.                                 {
163.                                     flag = 1;
164.                                     break;
165.                                 }
166.                             }
168.                             if ( flag == 0)
169.                             {
170.                                 data[count++] = tempdata;
171.                             }
172.                         }
173.                     }
174.                 }
175.             }
176.         }
177.         else if (num == 9)
178.         {
179.             for (int i=1; i<10; i+=2)
180.             {
181.                if (i==5)
182.                 continue;
184.                 for (int j=0; j<10; j++)
185.                 {
186.                     for (int k=0; k<10; k++)
187.                     {
188.                         for (int l=0; l<10; l++)
189.                         {
190.                             for (int m=0; m<10; m++)
191.                             {
193.                                 tempdata = i*100000001+j*10000010+k*1000100+l*101000+m*10000;
195.                                 for (int s=1; prime[s]*prime[s] <=tempdata; s++)
196.                                 {
197.                                     flag = 0;
198.                                     if (tempdata%prime[s]  == 0)
199.                                     {
200.                                         flag = 1;
201.                                         break;
202.                                     }
203.                                 }
205.                                 if ( flag == 0)
206.                                 {
207.                                     data[count++] = tempdata;
208.                                 }
209.                             }
210.                         }
211.                     }
212.                 }
213.             }
214.         }
216.         printf("%d/n",count);
217.         for (int i=0; i<count; i++)
218.         {
219.             printf("%d ",data[i]);
220.         }
221.         printf("/n");
222.     }
223. }