Recursive and very short clear solution for Roman Numerals by big312 - python coding challenges

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

Recursive and very short solution in Clear category for Roman Numerals by big312

def checkio(n):
    for a,b in [(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")]:
        if n>=a:
            return b+checkio(n-a)
    return ""

Oct. 3, 2014

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.