c++ && python TLE求调

#include<iostream>
using namespace std;

int is_prime(int n) {
    for (int i = 2; i<=n/2; i++) {
        if (n % i == 0) {
            return 0;
		}
	}
    return true;
}
int is_hw(int n) {
	int temp = n;
	int ans = 0;
	while(temp > 0){
		ans = ans*10 + temp%10;
		temp = temp/10;
	}
	if(n == ans) {
		return true;
	} else {
		return false;
	}
}
int main() {
	int a=0, b=0;
	cin >> a >> b;
	for(int i = a; i<= b; i++) {
		if(is_prime(i) && is_hw(i)) {
			cout << i << endl;
		} 
	}
}

def is_prime(n):
    flag = True
    for i in range(2, int(n**0.5)+1):
        if n % i == 0:
            flag = False
    return flag
a, b = map(int, input().split())
for i in range(a, b+1):
    if is_prime(i) and str(i) == str(i)[::-1]:
        print(i)