View Code of Problem 92

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int isPrime(int n){
	if(n<2) return 0;
	for(int i = 2;i*i <= n;i++){
		if(n%i==0) return 0;
	}
	return 1;
} 
int ishw(int n){
	int m = 0, k = n;
	while(k>0){
		m = m*10+k%10;
		k /= 10;
	}
	if(m==n) return 1;
	else return 0;
}
int main (){
	int n, m, a[10010], cnt = 0;
	scanf("%d%d", &n, &m);
	for(int i = n;i <= m;i++){
		if(ishw(i)&&isPrime(i)){
			a[cnt++] = i;
		}
	}
	int k = 0;
	for(int i = 0;i < cnt;i++){
		if(k%5==0&&k!=0) printf("\n");
		printf("%6d", a[i]);
		k++;
	}

	return 0;
}