View Code of Problem 92

#include<iostream>
#include<iomanip>
#include<string>
#include<cmath>
#include<algorithm>

using namespace std;

int isRe(const int n) {
	string s1, s2;
	s1 = s2 = to_string(n);
	reverse(s2.begin(), s2.end());
	if (s1 == s2) {
		return true;
	}
	return false;
}

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

int main() {
	int m, n;
	cin >> m >> n;
	int p = 1;
	for (int i = m; i <= n; ++i) {
		if (isRe(i) && isPrime(i)) {
			cout << setw(6) << i;
			if (p % 5 == 0) {
				cout << endl;
			}
			++p;
		}
	}
}