// C++ code for the above approach:
#include <iostream>
#include <string>
using namespace std;

// Function to check if a given number
// is a palindrome or not
bool isPalindrome(int num)
{
    int reverseNum = 0;
    int tempNum = num;

    while (tempNum != 0) {
        int remainder = tempNum % 10;
        reverseNum = reverseNum * 10 + remainder;
        tempNum /= 10;
    }

    return num == reverseNum;
}

// Function to find the smallest prime
// number in a given range
int smallestPrimeInRange(int start, int end)
{

    for (int num = start; num <= end; num++) {
        bool isPrime = true;
        for (int i = 2; i < num; i++) {
            if (num % i == 0) {
                isPrime = false;
                break;
            }
        }
        if (isPrime) {
            return num;
        }
    }

    // no prime number found in range
    return -1;
}

// Function to find the largest
// palindromic number in a given range and
// check if  it is divisible by the
// smallest prime number in the range
string largestPalindromicDivisibleBySmallestPrime(int start,
                                                  int end)
{
    int largestPalindrome = -1;
    for (int num = end; num >= start; num--) {
        if (isPalindrome(num)) {
            largestPalindrome = num;
            break;
        }
    }

    int smallestPrime = smallestPrimeInRange(start, end);
    if (smallestPrime == -1) {
        return "False";
    }

    if (largestPalindrome % smallestPrime == 0) {
        return "True";
    }
    else {
        return "False";
    }
}

// Driver code to test the function
int main()
{
    int start = 1;
    int end = 500;

    // Function call
    string result
        = largestPalindromicDivisibleBySmallestPrime(start,
                                                     end);
    cout << result << endl;

    start = 50;
    end = 1000;

    // Function call
    result = largestPalindromicDivisibleBySmallestPrime(
        start, end);
    cout << result << endl;

    return 0;
}