View Code of Problem 92

#include<stdio.h>
#include<cstdlib>
#include<cmath>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
int main(){
	int m,n,a[100000],c[100000];
	scanf("%d%d", &m, &n);
	if(m>n){
	  int temp=m;
	  m=n;
	  n=temp;
	}
	int k=0;
	for(int i=m;i<=n;i++){
		int j=2;
		while(i%j!=0){
			j++;
		}
		if(j==i) a[k++]=i;
	}
	
	int b,newed;
	int l=0;
      for(int i=0;i<k;i++){
      	 newed=0;
      	 b=a[i];
      	 do{
      	 	newed=newed*10+a[i]%10;
      	 	a[i]/=10;
		   }while(a[i]>0);
		   if(b==newed)
		    c[l++]=b;
		   
		   }
		   int count=0;
      	 for(int i=0;i<l;i++){
      	 	printf("%6d", c[i]);
      	 	count++;
      	 	if(count%5==0)
      	 	printf("\n");
		   }
	  
 
	
	return 0;
}