largest_palindrome.cpp

#include <iostream>
#include <sstream>

using namespace std;

bool isPalindrome(int n) {
    int reversedN = 0;

    stringstream originalStr;
    originalStr << n;

    stringstream reversedStr;
    reversedStr << string(originalStr.str().rbegin(), originalStr.str().rend());
    reversedStr >> reversedN;

    return n == reversedN;
}

int main() {
    int largestPalindrome = 0;

    for (int x = 800; x < 1000; x++) {
        for (int y = 800; y < 1000; y++) {
            int product = x * y;
            if (isPalindrome(product) && product > largestPalindrome) {
                largestPalindrome = product;
            }
        }
    }

    cout << largestPalindrome << endl;
    return 0;
}