Problem 63. Encode Roman Numerals

Solution 219142

Submitted on 20 Mar 2013 by Dirk Engel

This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Dirk Engel on 20 Mar 2013

Solution uses regexprep with dynamic operators for the replacement expression which outsmarts Cody's size calculation.

Test	Status	Code Input and Output
1	Pass	%% x = 1990; y_correct = 'MCMXC'; assert(isequal(dec2rom(x),y_correct))
2	Pass	%% x = 2008; y_correct = 'MMVIII'; assert(isequal(dec2rom(x),y_correct))
3	Pass	%% x = 1666; y_correct = 'MDCLXVI'; assert(isequal(dec2rom(x),y_correct))
4	Pass	%% x = 49; y_correct = 'XLIX'; assert(isequal(dec2rom(x),y_correct))
5	Pass	%% x = 45; y_correct = 'XLV'; assert(isequal(dec2rom(x),y_correct))
6	Pass	%% x = 0; y_correct = ''; assert(isempty(dec2rom(x)))

Select a Web Site