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

#include<bits/stdc++.h>
using namespace std;

int is_prime(int temp) {
    int i;
    for (i = 2; i <= sqrt(temp); i++) {
        if (temp % i == 0)
            return 0;
    }
    if (i > sqrt(temp))
        return 1;
}

int is_palindrome(int num) {
    int k = num;
    int temp = 0;
    while (k != 0) {
        temp = temp * 10 + k % 10;
        k /= 10;
    }
    if (temp == num && is_prime(temp) == 1)
        return 1;
    else
        return 0;
}

int main() {
    int num1, num2;
    cin >> num1 >> num2;
    for (int i = num1; i <= num2; i++) {
        if (is_palindrome(i))
            cout << i << endl;
    }
    system("pause");
    return 0;
}