View Code of Problem 92

#include<bits/stdc++.h>
using namespace std;
int num[2500] = { },k = 0;
bool find(int);
int main(){
	int x,y,fin[100] = { },op = 0;
	cin>>x>>y;
	for(int i = x;i<=y;i++){
		if(find(i))num[k++] = i;
	}
	for(int i = 0;i<k;i++){
		if(num[i] <100){
			if(num[i]/10 == num[i] % 10){
				fin[op++] = num[i];
			}
		}
		else if(num[i] >= 100 && num[i] <1000){
			if(num[i]/100 == num[i] % 10){
				fin[op++] = num[i];
			}
		}
		else{
			if((num[i]/1000 == num[i] % 10)&&((num[i]/100)%10 == num[i] % 100))
				fin[op++] = num[i];
		}
	}
	int flag = -1;
	for(int i = 0;i<op;i++){
		flag++;
		if(flag!=5)printf("%6d",fin[i]);
		else{
			cout<<endl;
			printf("%6d",fin[i]);
			flag = 0;
		}
		
	}
	
	return 0;
} 
bool find(int n){
	if(n<=1)return false;
	int sqr = (int)sqrt(1.0*n);
	for(int i = 2;i<=sqr;i++){
		if(n%i==0)return false;
	}
	return true;
}