View Code of Problem 92

#include<iostream>
#include<string>
#include<math.h>
using namespace std;
int isprime(int x){
	int flag=0;
	for(int i=2;i<=x/2;i++){
		if(x%i==0)return 0;
		else flag=1;
	}
	
	if(flag=1&&x!=1&&x!=0)return 1;
	
} 
int ishuiwen(int x){
	int a[100]={},k=0,flag=0;
	while(x){
		a[k++]=x%10; 
		x=x/10;
	}
	for(int i=0;i<k/2;i++){
		if(a[i]==a[k-1-i]){
			flag=1;
		}else{
		flag=0;
		break;
		}
	}
	if(flag==1)return 1;
	else return 0;
	
	
} 
int main(){	
	int m,n,b[1000]={},z=0;
	cin>>m>>n;
	if(m>n)swap(m,n);
	for(int i=m;i<=n;i++){
		if(isprime(i)==1&&ishuiwen(i)==1){
			z++;
			printf("%6d",i);
			if(z%5==0)cout<<endl;
		}	
	}
	return 0;
} 

Double click to view unformatted code.


Back to problem 92