View Code of Problem 92

#include<stdio.h>
#include<string.h>
#include<math.h>
#define N 1000

int Palindromic(int n);
int Prime(int n);

int main()
{
    int s,m,n,i,j=1,arr[N];
    scanf("%d%d", &m, &n);
    for(i = m; i <= n; i++)
    {
        if(Palindromic(i) && Prime(i))
        {
            arr[j++] = i;
        }
    }
    //s = strlen(arr);
    for(i = 1; i < j; i ++)
    {
        printf("%6.d",arr[i]);
        if(i % 5 == 0)
            printf("\n");
    }
    //printf("%6.d")
    return 0;
}

int Palindromic(int n)
{
    int i=0,a;
    a = n;
    while(a > 0)
    {
        i = i*10 + a%10;
        a = a/10;
    }
    if(n == i)
        return 1;
    else
        return 0;
}

int Prime(int n)
{
    int i;
    if(n <= 1)
        return 0;
    for(i = 2; i < n; i ++)
    {
        if(n % i == 0)
            return 0;
    }
    return 1;
}