View Code of Problem 92

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<malloc.h>

int huiwen(int n) {
	int y = 0, s = n;
	while (s > 0) {
		y = y * 10 + s % 10;
		s = s / 10;
	}
	if (y == n)
		return 1;
	else
		return 0;

}

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

int main(){
	int a,b;
	scanf("%d%d",&a,&b);
	int count = 0;
	for (int i = a; i <= b;i++) {
		if (isPrime(i) && huiwen(i)) {
			printf("%6d", i);
			count++;
		}
		if (count == 5) {
			printf("\n");
			count = 0;
		}
	}

}