View Code of Problem 92

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

int isSymmetry(int n){
	int a[10];
	int i;
	int quotient = 0;//商
	int remainder = 0;//余数
	for(i=0;i<10;i++){
		quotient = n/10;
		remainder = n%10;
		if(quotient!=0){ 
			n=quotient;
			a[i]=remainder;
		}else{
			a[i]=remainder;
			break;
		} 
	}
	
	for(int j=0;j<(i+1)/2;j++){
		if(a[j]!=a[i-j]){
			return 0;
		}
	}
	return 1;
}

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

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