Problem 4 Largest palindrome product （暴力枚举）

Largest palindrome product

Problem 4

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.

Answer:

906609
题解：水题也有题解？

代码：

#include <bits/stdc++.h>using namespace std;bool palindrome(int x){int tmp = x, ans = 0;while(x){ans = ans * 10 + x % 10; x /= 10;}if(tmp == ans)return 1;else return 0;}int main(){int ans=0;for(int i = 100; i <= 999; i++)for(int j = 100; j <= 999; j++)if(palindrome(i * j)){ans=max(ans,i*j);} cout<<ans<<endl;return 0;}