nQueens 문제 풀다가 도저히 안돼서 다른거 풀어보겠음...ㅠㅠ 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. #include int reverse(int n){ int reversed = 0; while(n>0) { reversed = 10*reversed+ n%10; n = n/10; } return reversed;} int isPalindrome(int n){ if(n==re..