欧拉计划 Problem4

#include<iostream>
#include<cstdio>
using namespace std;

bool ispalindrom(long n)
{
    long x = n,temp = 0;
    while(x)
    {
        temp = temp*10+x%10;
        x/=10;
    }
    return n==temp;
}
int main()
{
    int x,y;
    for(int i = 100; i <= 999; i++)
    {
        for(int j = 100; j <= 999; j++)
        {
            int temp = i*j; 
            if(ispalindrom(temp))
            {
                x = i,y=j;
            }
        }   
    }
    cout << x <<" "<< y;    
}