P1217 [USACO1.5]回文质数 Prime Palindromes

P1217 [USACO1.5]回文质数 Prime Palindromes

#include <iostream>
#include <cmath>

using namespace std;

int a,b,x;

long int huiwen(int n);
int is_odd(int num);

long int hui=0;
long int huiwen(int n)
{

    if(n==0)
        return 1;
    else
    {
        hui *= 10;
        hui += n%10;
        huiwen(n/10);
    }
}

int is_odd(int num)
{
    long int  i, tmp;

    //cout << num << endl;
    tmp = sqrt(num);
    for(i=2; i<=tmp; i++)
    {
        if(num%i == 0)
            return 0;
    }
    return 1;
}

int main()
{
    int j;

    cin >> a >> b;
    for (j=a; j<=b; j++)
    {
        if(j == 9989900)
            return 0;

        x=j;
        hui = 0;
        huiwen(x);
        if (hui==x)
        {
            if(is_odd(j))
                cout << j << endl;
        }
    }
    return 0;
}