View Code of Problem 92

#include<bits/stdc++.h>

using namespace std;

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

int main()
{
    int m,n;
    scanf("%d%d",&m,&n);
    if(m > n)
        swap(m,n);
    int count1 = 0;
    for(int i = m; i <= n; ++i){

        if (isprime(i)){
        int p = i;
        int sum = 0;
        while (p > 0){
            sum = sum * 10 + p % 10;
            p = p / 10;
        }
        if(sum == i){
            count1++;
            printf("%6d",i);

        }
        if(count1 % 5 == 0)
          printf("\n");
        }
    }
    return 0;
}