programing using C++ A palindromic number reads the same both ways. The largest

Question

programing using C++

A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 99.

Find the largest palindrome made from the product of two 3-digit numbers.

Explanation / Answer

public class Palindrome { public static void main(String[] args) { int i, j; int m = 1; int k =11; boolean flag = false; while (true) {; if (flag) j = m + 1; else j = m; for (i = k; i > 0; i--) { j++; int number, temp, remainder, sum = 0; number = temp = (1000 - i) * (1000 - j); while (number > 0) { remainder = number % 10; number /= 10; sum = sum * 10 + remainder; } if (sum == temp) { System.out.println("Max value:"+temp); return; } } if (flag) m++; k=k+11; flag = !flag; } } }

Related Questions

Navigate

• Browse (All)
• Browse P
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.