static int roman_numeral_to_integer (String s) {
                for (int i = 1; i < 4000; i++) if (s.toUpperCase().equals(integer_to_roman_numeral(i))) return i;
                return 0;
        }

class isRomanNumeral {
        public static boolean is_roman_numeral (String n) {
                  //Converting it to a number
                  n = n.toUpperCase();
                  String ro = n;
          char [] roChars = {'I','V','X','L','C','D','M'};
          char [] arabicChars = {1,5,10,50,100,500,1000};
         
          int k = 0;
          int arabic = 0; 
         
          while (k < ro.length()) {
             int number = 0;
             
             for (int j = 0; j < roChars.length; j++)
                   if (roChars[j]==ro.charAt(k)) number = arabicChars[j];
               
             k++;
             
             if (k != ro.length()) {
                int next = 0;
                for (int j = 0 ; j < roChars.length; j++)
                                if (roChars[j] == ro.charAt(k)) next = arabicChars[j];
                               
                if (next > number) {
                   number = next - number;
                   k++;
                }
             }
             arabic += number;
                }
          //Converting to roman again
          String [] ones = {"I","II","III", "IV", "V", "VI", "VII", "VIII", "IX", "X","XX","XXX", "XL", "L", "LX", "LXX", "LXXX", "XC","C","CC","CCC", "CD", "D", "DC", "DCC", "DCCC", "CM", "M","MM","MMM", "Mv", "v", "vM", "vMM", "vMMM", "xM"};
                  String finalAnsReversed = ""; //Reverse of answers from ans
                  for (int i = 0; i < 4; i++) {
                        int mod = arabic % 10;
                        arabic /= 10;
                        if (mod == 0) continue; //dont want array[-1] rofl.
                        else finalAnsReversed = ones[(i*9)+(mod-1)] + finalAnsReversed;
                }
                //Main Answer, check to see if they yield the same result, if they do then it is valid, else its not
                if (finalAnsReversed.equals(n)) return true;
                else return false;
        }
       
        public static void main (String [] Args) {
                String n = "IIII";
                System.out.println("WELCOME TO MYSTIC'S ROMAN NUMERAL CHECKER");
                System.out.println();
                System.out.println(n + " is a valid roman numeral? " + is_roman_numeral(n));
                System.out.println();
        }
}

fcn integer_to_roman_numeral (integer : nat, output : string) : string
    var numerals : array 1 .. 2, 1 .. 9 of string := init ("M", "D", "C", "L", "X", "IX", "V", "IV", "I", "1000", "500", "100", "50", "10", "9", "5", "4", "1")
    for i : 1 .. 9
        if integer >= strint (numerals (2, i)) then
            result integer_to_roman_numeral (integer - strint (numerals (2, i)), output + numerals (1, i))
        end if
    end for
    result output
end integer_to_roman_numeral

fcn roman_numeral_to_integer (input : string, total : nat) : nat
    var numerals : array 1 .. 2, 1 .. 9 of string := init ("M", "D", "C", "L", "X", "IX", "V", "IV", "I", "1000", "500", "100", "50", "10", "9", "5", "4", "1")
    for i : 1 .. 9
        if index (Str.Upper (input), numerals (1, i)) = 1 then
            result roman_numeral_to_integer (input (length (numerals (1, i)) + 1 .. length (input)), total + strint (numerals (2, i)))
        end if
    end for
    result total
end roman_numeral_to_integer

put integer_to_roman_numeral (2006, "")
put roman_numeral_to_integer ("MmVi", 0)

// MADE BY MYSTIC VEGETA, CONVERTS ROMANS TO ARABIC
 // NOTE: I COULD PROGRAM THIS IS IN LESSER LINES, BUT IT WOULD BE IMPOSSIBLE TO READ, ROFL. <0_0>
 // LANG: JAVA
 
 
 class RomanToArabic {
 
       public static int roman_numeral_to_integer (String ro) {
          ro = ro.toUpperCase();
          char [] roChars = {'I','V','X','L','C','D','M'};
          char [] arabicChars = {1,5,10,50,100,500,1000};
         
          int k = 0;
          int arabic = 0; 
         
          while (k < ro.length()) {
             int number = 0;
             
             for (int j = 0; j < roChars.length; j++)
                   if (roChars[j]==ro.charAt(k)) number = arabicChars[j];
               
             k++;
             
             if (k != ro.length()) {
                int next = 0;
                for (int j = 0 ; j < roChars.length; j++)
                                if (roChars[j] == ro.charAt(k)) next = arabicChars[j];
                               
                if (next > number) {
                   number = next - number;
                   k++;
                }
             }
             arabic += number;
                }
                return arabic;
       }
         
       public static void main (String [] Args) {
                String n = "MMMCMXCIX";
                        System.out.println("WELCOME TO MYSTIC VEGETA'S CONVERTER");
                        System.out.println ("Edit the n so that its a roman numberal");
                        System.out.println ();
                        System.out.println (n + " = " + roman_numeral_to_integer (n));
                        System.out.println ();
       }
       
}

var number : int
var remainder : int
var answer : array 1 .. 7 of int

put "enter a base 10 number"
get number


remainder := number mod 1000
answer (1) := number div 1000
for i : 1 .. answer (1)
    put "M" ..
end for

answer (2) := remainder div 500
remainder := number mod 500
for i : 1 .. answer (2)
    put "D" ..
end for

answer (3) := remainder div 100
remainder := number mod 100
for i : 1 .. answer (3)
    put "C" ..
end for

answer (4) := remainder div 50
remainder := number mod 50
for i : 1 .. answer (4)
    put "L" ..
end for

answer (5) := remainder div 10
remainder := number mod 10
for i : 1 .. answer (5)
    put "X" ..
end for

answer (6) := remainder div 5
remainder := number mod 5
for i : 1 .. answer (6)
    put "V" ..
end for

answer (7) := remainder div 1
for i : 1 .. answer (7)
    put "I" ..
end for

var roman_numeral : array 1 .. * of string := init ("M", "CM", "D", "CD", "C", "XC", "L", "XL", "X", "IX", "V", "IV", "I")
var numeral_value : array 1 .. * of int := init (1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1)

%%% Solution #1 %%%
fcn integer_to_roman_numeral (num : int) : string
    var number : int := num
    var result_numeral : string := ""
    for i : 1 .. upper (roman_numeral)
        loop
            exit when number < numeral_value (i)
            result_numeral := result_numeral + roman_numeral (i)
            number -= numeral_value (i)
        end loop
    end for
    result result_numeral
end integer_to_roman_numeral