View Code of Problem 92

#include <stdio.h>
int isPrime(int x)
{
	int flag = 1;
	int i,j;
	if(x==1)
	{
		flag = 0;
	}
	else if(x==2)
	{
		flag = 1;
	}
	else
	{
		for(i=2;i<x;++i)
	{
		if(x%i==0)
		{
			flag = 0;
			break;
		}
	}
	}
	return flag;
}
int hui(int x)
{
	int flag1 = 0;
	int j=0,s;
	int k = x;
	do{
		j = j*10+k%10;
		k = k/10;
	}while(k>0);
	if(j == x)
	{
		flag1 = 1;
	}
	return flag1;
}
int main()
{
	int i,cnt = 0,a,b;
	scanf("%d %d",&a,&b);
	for(i=a;i<=b;i++)
	{
		if(hui(i)&&isPrime(i))
		{
			cnt++;
            printf("%6d",i);
           if(cnt%5==0)
             printf("\n");
		}
	}
	return 0;
}