Solved

How to convert decimal number to roman number in Java

Posted on 2001-08-10
4
1,578 Views
Last Modified: 2012-05-04
Hi all,

     I want to know how to convert decimal number to roman number and vice-versa.

manohar.

0
Comment
Question by:manu_gmr
  • 2
4 Comments
 
LVL 2

Accepted Solution

by:
DidierD earned 25 total points
ID: 6379209
public class Int2Rom {

    /* here goes control arrays for roman numerals */

    /* let: char symbols for each value */
   
    static char[] let = { 'I', 'V', 'X', 'L' };

    /* min: the idea of this array is to determine, how
     * long can we use this numeral, even if value is less
     * then numeral value. e.g. if int==8, then numeral
     * will be 'X'-2, i.e. IIX
     */

    static int[]  min = { 0, 1, 2, 2 };

    /* val: values for numerals */

    static int[]  val = { 1, 5, 10, 50 };

    /* ref: references to numbers we can substract.
     * For 'L' we can substract only 'X', for 'X' and 'V'
     * we can substract only 'I's
     */

    static int[]  ref = { 0, 0, 0, 2 };

    /* values: last index in arrays */
   
    static int values = 3;

    static void usage() {
     System.out.println("Usage: java Int2Rom integer_number");
     System.exit(1);
    }

    public static void main(String args[]) {

     int arg = 0;

     if (args.length < 1) {
         usage();
     }

     try {
         arg = Integer.parseInt(args[0]);
     } catch (Exception e) {
         usage();
     }

     String result = process(arg);

     System.out.println("Integer = "+arg+", Roman = "+result);
     System.exit(0);

    }

    static String process(int x) {

     
     int cval = values; // set index to the last one.
     String res = new String(""); // create empty string

     while (cval >= 0) { // up to all values

         // this while{} will work if we can print let[cval]
         
         while (x >= (val[cval]-(min[cval]*val[ref[cval]]))) {

          System.err.println("x="+x+",max="+
               (val[cval]-(min[cval]*val[ref[cval]]))+
               " == do addRight("+let[cval]+")");
         
          res = addRight(res, let[cval]);

          int recall = 0;

          System.err.println("Prepare loop: "+
               "lmt="+(val[cval]-x)+", step="+val[ref[cval]]);
         
          // this loop will only work if the original value
          // was less than numeral value.
         
          for (int i=0; i<(val[cval]-x);i+=val[ref[cval]]) {
              System.err.println("Incomplete "+(-i+val[cval]-x)+", do"+
                   "addLeft("+let[ref[cval]]+"), i="+i);
              res = addLeft(res, let[ref[cval]]);
              recall++;
          }
         
          // this line reduce original value on the value we
          // already printed
         
          x -= (val[cval]-(recall*val[ref[cval]]));
         }

         cval--;
         
     }

     return res;
     
    }

    /* this method adds character to the end of sourse string */

    static String addRight(String orig, char c) {

     String res = orig.concat(String.valueOf(c));
     return res;
     
    }

    /* this method inserts character before last character of the
     * source string */

    static String addLeft(String orig, char c) {

     char last = orig.charAt(orig.length()-1);

     System.err.print("aL: last="+last);

     String res = orig.substring(0,orig.length()-1);

     System.err.print(", lside="+res+", concat=>"+c+"< and >"+last+"<");

     res = (res.concat(String.valueOf(c))).concat(String.valueOf(last));

     System.err.println(", fin="+res);

     return res;

    }

}

0
 
LVL 2

Expert Comment

by:DidierD
ID: 6379238
Hi,

For converting from roman to decimal number see at http://java.oreilly.com/bite-size/java_0698.html

Didier
0
 

Expert Comment

by:CleanupPing
ID: 9061888
manu_gmr:
This old question needs to be finalized -- accept an answer, split points, or get a refund.  For information on your options, please click here-> http:/help/closing.jsp#1 
EXPERTS:
Post your closing recommendations!  No comment means you don't care.
0
 
LVL 20

Expert Comment

by:Venabili
ID: 9330076
No comment has been added lately, so it's time to clean up this TA.
I will leave a recommendation in the Cleanup topic area that this question is:

- Points for DidierD

Please leave any comments here within the next seven days.
 
PLEASE DO NOT ACCEPT THIS COMMENT AS AN ANSWER!
 
Venabili
EE Cleanup Volunteer
0

Featured Post

On Demand Webinar - Networking for the Cloud Era

This webinar discusses:
-Common barriers companies experience when moving to the cloud
-How SD-WAN changes the way we look at networks
-Best practices customers should employ moving forward with cloud migration
-What happens behind the scenes of SteelConnect’s one-click button

Question has a verified solution.

If you are experiencing a similar issue, please ask a related question

Suggested Solutions

Title # Comments Views Activity
CSV file parsing thru Java 13 39
Is there a simpler dropbox system? 10 44
Selenium docs api java index 3 66
Print Rhino Java Array in Javascript 1 36
Java had always been an easily readable and understandable language.  Some relatively recent changes in the language seem to be changing this pretty fast, and anyone that had not seen any Java code for the last 5 years will possibly have issues unde…
Go is an acronym of golang, is a programming language developed Google in 2007. Go is a new language that is mostly in the C family, with significant input from Pascal/Modula/Oberon family. Hence Go arisen as low-level language with fast compilation…
Viewers will learn about arithmetic and Boolean expressions in Java and the logical operators used to create Boolean expressions. We will cover the symbols used for arithmetic expressions and define each logical operator and how to use them in Boole…
This theoretical tutorial explains exceptions, reasons for exceptions, different categories of exception and exception hierarchy.

749 members asked questions and received personalized solutions in the past 7 days.

Join the community of 500,000 technology professionals and ask your questions.

Join & Ask a Question