fork(2) download 
  1. /* package whatever; // don't place package name! */
  2.  
  3. import java.util.*;
  4. import java.lang.*;
  5. import java.io.*;
  6.  
  7. public class Main {
  8.     static boolean isPalindrome(String s){
  9.         return new StringBuffer(s).reverse().toString().equals(s) ;
  10.     }
  11.  
  12.     public static void main(String[] args) {
  13.         int max = 999;
  14.         int min =100;
  15.         int prod=0;
  16.         boolean isTrue = false;
  17.         for (int i = max; i >=min ; i--) {
  18.             for (int j = max; j >= min; j--) {
  19.                 prod=i*j;
  20.                 if(isPalindrome(String.valueOf(prod))){
  21.                     isTrue=true;
  22.                     break;
  23.                 }
  24.             }
  25.             if(isTrue)break;
  26.         }
  27.         System.out.println("largest palindrome made from the product of two 3-digit numbers is:"+prod) ;
  28.     }
  29. }
  30.  
Success #stdin #stdout 0.11s 320320KB
comments (?)
stdin 
Standard input is empty
stdout 
largest palindrome made from the product of two 3-digit numbers is:580085
https://ideone.com/n4H8rL
language:
Java (HotSpot 12)
created:
9 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!