C++ program to find largest palindrome number

/* Find the largest palindrome made form the product of two 3-digit numbers */ #include using namespace std; bool isPalindrome(int number); int main() { long largest = 0; for (int i=999; i>0; i--) for (int j=999; j>0; j--) if(isPalindrome(i*j)) if (i*j > largest) largest = i*j; cout << "Largest palindrome is " << largest; return 0; } bool isPalindrome(int number) { int original = number; int reverse = 0; for (int i=0; i<=number; i++) { int remain = number%10; number = number/10; reverse = reverse*10 + remain; } return reverse == original; } // aiuto