Prime Palindromes

#include<fstream>#include<cmath>using namespace std;bool isprime(int i){int j;for(j=2;j<=sqrt(i);j++){if(i%j==0)return false;}return true;}bool ispal(int i){int j=i,k=0,l,a[10];while(j){a[++k]=j%10;j=j/10;}for(j=1,l=k;j<=k/2+1;j++,l--){if(a[j]!=a[l])return false;}return true;}int main(){ifstream fin ("pprime.in");ofstream fout ("pprime.out");int a,b,i;fin>>a>>b;for(i=a;i<=b;i++){if(i==2 || i==3  || i==5  || i==7  || i==11){fout<<i<<endl;continue;}        if(i%2==0 || i%3==0 || i%5==0 || i%7==0 || i%11==0 || i%13==0 || i%17==0 || i%19==0)continue;if(ispal(i)  && isprime(i)){fout<<i<<endl;}}return 0;}