COCI '09 Contest 2 #2 Rimski

View as PDF

Submit solution

Points: 5
Time limit: 1.0s
Memory limit: 32M

Problem type
Allowed languages
Ada, Assembly, Awk, Brain****, C, C#, C++, COBOL, CommonLisp, D, Dart, F#, Forth, Fortran, Go, Groovy, Haskell, Intercal, Java, JS, Kotlin, Lisp, Lua, Nim, ObjC, OCaml, Octave, Pascal, Perl, PHP, Pike, Prolog, Python, Racket, Ruby, Rust, Scala, Scheme, Sed, Swift, TCL, Text, Turing, VB, Zig

Using roman numerals the numbers 1, 2, 3, 4, 5, 6, 7, 8, 9 are written as I, II, III, IV, V, VI, VII, VIII, IX. Numbers 10, 20, 30, 40, 50, 60, 70, 80, 90 are written as X, XX, XXX, XL, L, LX, LXX, LXXX, XC.

Any number smaller than 100 can be written by converting tens and ones separately and concatenating the results. So, for example, the number 48 would be written as XLVIII, XL for 40 and VIII for 8.

Given a number written in roman numerals, rearrange its characters so that you create the smallest possible number, written in roman numerals.


The first and only line of input contains one integer B (1 \le B < 100), written using roman numerals.


The first and only line of output should contain a rearrangement of input characters so that it represents the smallest possible number, written in roman numerals.

Sample Input 1


Sample Output 1


Sample Input 2


Sample Output 2


Sample Input 3


Sample Output 3



There are no comments at the moment.