既是质数也是回文数

质数（prime number）又称素数，有无限个。
质数定义为在大于1的自然数中，除了1和它本身以外不再有其他因数。（注意1不是质数）
“回文”是指正读反读都能读通的句子，在自然数中，最小的回文数是0，其次是1,2,3,4,5,6,7,8,9,11,22,33,44,55,66,77,88,99,101,111,121,131,141,151,161,171,181,191,202,212,222,232,242,252,262,272,282,292,303,313,323,333,343,353,363,373,383,393,404,414,424,434,444,454,464,474,484,494,505,515,525,535,545,555,565,575,585,595,606,616,626,636,646,656,666,676,686,696,707,717,727,737,747,757,767,777,787,797,808,818,828,838,848,858,868,878,888,898,909,919,929,939,949,959,969,979,989,999.

#include<iostream>
#include<math.h>
using namespace std;
//判断质数
int isPrime(int x)
{
    int flag = 1;
    if (x==1)
    {
        flag = 0;
    }
    int k = (int)(sqrt(x));
    for (int i = 2; i <= k; i++)
    {
        if (x%i == 0)
        {
            flag = 0;
            break;
        }
    }
    if (flag)
        return 1;
    return 0;
}
//判断回文数
int isHuiwen(int x)
{
    int c, t = 0;
    c = x;
    while (c)
    {
        t *= 10;
        t += c % 10;
        c /= 10;
    }
    if (t == x)
        return 1;
    return 0;
}

int main()
{
    int L, R;
    while (cin >> L >> R && L >= 1 && L <= R &&R <= 1000){
        int count = 0;
        for (int i = L; i <= R; i++)
        {
            if (isPrime(i) && isHuiwen(i))
            {
                count++;
            }
        }
        cout << count << endl;
    }

    return 0;
}