Created
November 8, 2019 13:52
-
-
Save possibly-wrong/93b4ba2e3e57a0c4463da506f7d47e0a to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
units = ['zero', 'one', 'two', 'three', 'four', 'five', 'six', 'seven', | |
'eight', 'nine', 'ten', 'eleven', 'twelve', 'thirteen', 'fourteen', | |
'fifteen', 'sixteen', 'seventeen', 'eighteen', 'nineteen'] | |
tens = ['zero', 'ten', 'twenty', 'thirty', 'forty', 'fifty', 'sixty', | |
'seventy', 'eighty', 'ninety'] | |
powers = ['zero', 'thousand', 'million', 'billion', 'trillion', | |
'quadrillion', 'quintillion', 'sextillion', 'septillion', 'octillion', | |
'nonillion', 'decillion'] | |
hundred = 'hundred' | |
minus = 'minus' | |
comma = ',' | |
and_ = ' and' | |
space = ' ' | |
hyphen = '-' | |
empty = '' | |
def small_integer_name(n, use_and=False): | |
s = empty | |
if n >= 100: | |
q, n = divmod(n, 100) | |
s = units[q] + space + hundred + ( | |
(and_ if use_and else empty) + space if n > 0 else empty) | |
if n >= 20: | |
q, n = divmod(n, 10) | |
s += tens[q] + (hyphen if n > 0 else empty) | |
return (s + units[n] if n > 0 else s) | |
def integer_name(n, use_comma=False, use_and=False, power=0): | |
if n < 0: | |
return minus + space + integer_name(-n, use_comma, use_and) | |
elif n == 0: | |
return units[0] | |
s = empty | |
if n >= 1000: | |
q, n = divmod(n, 1000) | |
s = integer_name(q, use_comma, use_and, power + 1) + ( | |
(comma if use_comma else empty) + space if n > 0 else empty) | |
return (s + small_integer_name(n, use_and) + | |
(space + powers[power] if power > 0 else empty) if n > 0 else s) | |
def fixed(n): | |
return [k for j, (name, k) in enumerate(sorted( | |
((integer_name(k), k) for k in range(1, n + 1))), start=1) if k == j] | |
for n in range(1, 10001): | |
print(n, fixed(n)) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment