View Code of Problem 92

#include<stdio.h>
#include<string.h>
#include<math.h>
int isPrime(int n){
	int i;
	if(n<=2) return 0;
	for(i = 2;i*i <= n; i++){
		if(n%i==0) return 0;
	}
	return 1;
}
int isHui(int n){
	
	int a[5],i;
	int count = 0;
	while(n!=0){
		a[count++] = n%10;
		n /= 10;
	}
	for(i = 0;i < count ;i++){
		if(a[i]!=a[count-1-i]){
			return 0;
		}
	}
	return 1;
}
int main(){
	int m,n;
	scanf("%d %d",&m,&n);
	int a[1000];
	int count = 0,i;
	for(i = m;i < n; i++){
		if(isHui(i)==1&&isPrime(i)==1){
			a[count++] = i;
		}
	}
	int flag = 1;
	for(i = 0;i < count; i++){
		if(flag==5){
			printf("%6d\n",a[i]);
			flag = 1;}
		else {
			printf("%6d",a[i]);
			flag++;
		}
	}	
	return 0;
		
}