View Code of Problem 92

#include <iostream>
#include <math.h>
using namespace std;

bool isprime(int n){
    if(n<=1)
        return false;
    int bound = (int)sqrt(n)+1;
    for(int j=2;j<bound;j++){
        if(n%j==0)
            return false;
    }
    return true;
}

bool isPalindrome(int n){
    int y=0,s;
    s=n;
    while(s){
        y=y*10+s%10;
        s/=10;
    }
    if (y==n)
        return true;
    else
        return false;
}

int main(){
    int m,n,k=0;
    scanf("%d%d",&m,&n);
    int ans[1000];
    for (int i = m; i < n; i++)
    {
        if (isPalindrome(i))
        {
            if (isprime(i)) {
                ans[k++] = i;
            }
        }
    }
    
    for (int i = 0; i < k; i++)
    {
        if ((i+1)%5==0)
            printf("%6d\n", ans[i]);
        else
            printf("%6d", ans[i]);
    }
    
    return 0;
}