Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
History solution in Creative category for Roman Numerals by veky
def checkio(n:int) -> str:
pool = "m2d5c2l5x2v5i"
rep = lambda t: int(pool[t - 1])
def roman(n, j=0, v=1000):
while True:
while n >= v: yield pool[j]; n -= v
if n <= 0: return
k = j + 2; u = v // rep(k)
if rep(k) == 2: k += 2; u //= rep(k)
if n + u >= v: yield pool[k]; n += u
else: j += 2; v //= rep(j)
return "".join(roman(n)).upper()
May 10, 2015
Comments: