Recursion clear solution for Roman Numerals by JumpCutter - python coding challenges

Enable Javascript in your browser and then refresh this page, for a much enhanced experience.

Recursion solution in Clear category for Roman Numerals by JumpCutter

vals = [(1000, 'M'),(900, 'CM'),(500, 'D'),(400, 'CD'),
        (100, 'C'), (90, 'XC'), (50, 'L'), (40, 'XL'),
        (10, 'X'),  (9, 'IX'),  (5, 'V'),  (4, 'IV'),(1, 'I')]
checkio=r=lambda n: next(v==n and c or c + r(n-v) for v,c in vals if v<=n)

Sept. 4, 2015

Comments:

JWKiwi_b9e6ddeee0c24de4bcdfc8d on Jan. 26, 2016, 7:39 a.m.
<p>Good for minimal lines of code, but completely unreadable</p>

wo.tomasz on April 23, 2021, 2:27 p.m.
<p>Probably the shortest solution to this task :) </p>

GitHub

0 %

You ClassRoom Demo is Ready With the new tool CheckiO ClassRoom, you will be able to analyze your students' progress, have your own leaderboard, change missions order on the map, and so on.