Create a function taking a non-negative integer as its parameter and returning a string containing the Roman Numeral representation of that integer.
By convention, "modern" Roman numerals are written by expressing each digit separately starting with the leftmost digit and skipping any digit with a value of zero.
Examples
n will always be an integer between 0 and 3999 (inclusive).
This problem is adapted from Rosetta Code.
It would be good if Cody penalized huge strings. :)
Solution uses regexprep with dynamic operators for the replacement expression which outsmarts Cody's size calculation.
This is just silly. It's gaming the Matlab grader, and not doing a particularly good job at that. Why should this stop at 3999?
Very nicely done.
2373 Solvers
Find the alphabetic word product
1922 Solvers
518 Solvers
Getting the row and column location from a matrix
184 Solvers
286 Solvers