<OJ_Sicily>Prime Palindromes

Description

The number 151 is a prime palindrome because it is both a prime number and a palindrome (it is the same number when read forward as backward). Write a program that finds all prime palindromes in the range of two supplied numbers a and b (5 <= a < b <= 100,000,000); both a and b are considered to be within the range .

Input

There are multiple test cases.

Each case contains two integers, a and b.

a=b=0 indicates the end of input.

Output

For each test case, output the list of palindromic primes in numerical order, one per line.

题目解释：这道题主要是求解为质数的回文数

解题思路：在这里利用回文数的特点进行求解，也就是列举全部的回文数，然后判断其是否为质数，质数的判断是使用开根号方法缩小范围。

（1）4，6，8位的回文数没有质数。

对于4位回文数，有abba形式，那么abba = 1001*a + 110*b， 而1001*a + 110*b 肯定是可以被11整除的。同理对于6，8位回文数也肯定是可以被11整除，因此不存在4，6，8位回文数为质数

（2）关于回文数规律

比如5位回文数，其形式为ABCBA， 那么只需要3个for循环便可得到全部回文数，第一个for循环是A从1~9（其实A不能是偶数），第二个for循环是B从0~9，同理第三个for循环是从0~9.因此可以表示完全部的回文数，回文数为10001*A + 1010*B + 100*C

同理可以推出其他的回文数

#include<iostream>
#include <algorithm>
#include <math.h>
using namespace std;
int a, b;
bool isPrime(int k){
    double m = sqrt(k);
    for (int i = 2; i <= m; i++) {
        if (k % i == 0) {
            return false;
        }
    }
    return true;
}
int main(){
    while (cin >> a >> b) {
        if (a == 0 && b == 0) break;
        int tmp;

        for (int i = 2; i <= 7; i ++) {   // 1位回文数
            tmp = i;
            if (i >= a && i <= b && isPrime(tmp)) {
                cout << tmp << endl;
            }
        }
        for (int i = 1; i <= 9; i+= 2) {  // 两位回文数
            tmp = 11* i;
            if (tmp >= a && tmp <= b && isPrime(tmp)) {
                cout << tmp << endl;
            }
        }
        for (int i = 1; i <= 9; i+= 2){     // 3 位数回文
            for (int j = 0; j <= 9; j ++) {
                tmp = i * 101 + j * 10;
                if (tmp >= a && tmp <= b && isPrime(tmp)) {
                    cout << tmp << endl;
                }
            }
        }
        for (int i = 1; i <= 9; i +=2) {    // 5位数回文
            for (int j = 0; j <= 9; j ++) {
                for (int k = 0; k <= 9; k ++) {
                    tmp = 10001 * i + 1010 * j + 100 * k;
                    if (tmp >= a && tmp <= b && isPrime(tmp)) {
                        cout << tmp << endl;
                    }
                }
                
            }
        }
        for (int i = 1; i <= 9; i += 2) {    // 7位数回文
            for (int j = 0; j <= 9; j ++) {
                for (int k = 0; k <= 9; k ++) {
                    for (int l = 0; l <= 9; l++) {
                        tmp = 1000001 * i + 100010 * j + 10100 * k + 1000 * l;
                        if (tmp >= a && tmp <= b && isPrime(tmp)) {
                            cout << tmp << endl;
                        }
                    }
                }
            }
        }

        for (int i = 1; i <= 9; i ++) {    //9位数回文
            for (int j = 0; j <= 9; j ++) {
                for (int k = 0; k <= 9; k ++) {
                    for (int l = 0; l <= 9; l++) {
                        for (int m = 0; m <= 9; m ++) {
                            tmp = 100000001 * i + 10000010 * j + 1000100 * k + 101000 * l + 10000 * m;
                            if (tmp >= a && tmp <= b && isPrime(tmp)) {
                                cout << tmp << endl;
                            }
                        }
                        
                        
                    }
                }
            }
        }
        
    }
    return 0;
}