问题标题: 洛谷：P1217 [USACO1.5]回文质数 Prime Palindromes

题目传送门

#include<iostream>
#include<cstdio>
#include<string>
#include<cmath>
#include<sstream>
using namespace std;
long long m,n,cnt;
bool hw(long long x){
    string s;
    stringstream v;
    v<<x;
    v>>s;
    long long i=0,j=s.size()-1;
    while(i<=j){
        if(s[i]!=s[j]){
            return false;
        }
        i++;
        j--;
    }
    return true;
}
bool Judge(long long x){
    if(x==1) return false;
    for(long long i=2;i<=sqrt(x);i++){
        if(x%i==0){
            return false;
        }
    }
    return true;
}
int main(){
    cin>>m>>n;
    for(long long i=m;i<=n;i++){
        if(hw(i)&&Judge(i)){
            cout<<i<<endl;
        }
    }
    return 0;
}

66分代码求改错