forked from thegraycuber/fastest_numbers
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathfastest_numbers_english_collaborative.py
More file actions
352 lines (295 loc) · 15.6 KB
/
fastest_numbers_english_collaborative.py
File metadata and controls
352 lines (295 loc) · 15.6 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
import math
one_names = [
[["zero", 2], ["zeroeth", 2]],
[["one", 1], ["first", 1]],
[["two", 1], ["second", 2]],
[["three", 1], ["third", 1]],
[["four", 1], ["fourth", 1]],
[["five", 1], ["fifth", 1]],
[["six", 1], ["sixth", 1]],
[["seven", 2], ["seventh", 2]],
[["eight", 1], ["eighth", 1]],
[["nine", 1], ["ninth", 1]],
[["ten", 1], ["tenth", 1]],
[["eleven", 3], ["eleventh", 3]],
[["twelve", 1], ["twelfth", 1]],
[["thirteen", 2], ["thirteenth", 2]],
[["fourteen", 2], ["fourteenth", 2]],
[["fifteen", 2], ["fifteenth", 2]],
[["sixteen", 2], ["sixteenth", 2]],
[["seventeen", 3], ["seventeenth", 3]],
[["eighteen", 2], ["eighteenth", 2]],
[["nineteen", 2], ["nineteenth", 2]],
]
ten_names = [
[[]],
[[]],
[["twenty", 2], ["twentieth", 3]],
[["thirty", 2], ["thirtieth", 3]],
[["forty", 2], ["fortieth", 3]],
[["fifty", 2], ["fiftieth", 3]],
[["sixty", 2], ["sixtieth", 3]],
[["seventy", 3], ["seventieth", 4]],
[["eighty", 2], ["eightieth", 3]],
[["ninety", 2], ["ninetieth", 3]],
]
large_names = [
["hundred",2,100,2],
["thousand",2,1000,3],
["million",2,1000000,6],
["billion",2,1000000000,9],
]
superscripts = ['⁰','¹','²','³','⁴','⁵','⁶','⁷','⁸','⁹',
'¹⁰','¹¹','¹²','¹³','¹⁴','¹⁵','¹⁶','¹⁷','¹⁸','¹⁹',
'²⁰','²¹','²²','²³']
pemdas_count = 6
def base_syllables(n):
if n < 20:
return one_names[n][0][1], one_names[n][0][0], one_names[n][1][1], one_names[n][1][0], 0, 1
if n < 100:
n_mod = n % 10
n_div = n // 10
if n % 10 == 0:
return ten_names[n_div][0][1], ten_names[n_div][0][0], ten_names[n_div][1][1], ten_names[n_div][1][0], 1, 2
return (
ten_names[n_div][0][1] + number_names[n_mod]["syllables"][1],
ten_names[n_div][0][0] + "-" + number_names[n_mod]["names"][1],
ten_names[n_div][0][1] + number_names[n_mod]["syllables"][0],
ten_names[n_div][0][0] + "-" + number_names[n_mod]["names"][0],
0,
2
)
large_index = 0
while (large_names[large_index+1][2] <= n):
large_index += 1
n_mod = n % large_names[large_index][2]
n_div = n // large_names[large_index][2]
if n_mod == 0:
return (
number_names[n_div]["syllables"][1] + large_names[large_index][1],
number_names[n_div]["names"][1] + " " + large_names[large_index][0],
number_names[n_div]["syllables"][1] + large_names[large_index][1],
number_names[n_div]["names"][1] + " " + large_names[large_index][0] + "th",
large_names[large_index][3] + number_names[n_div]["zeroes"],
large_names[large_index][3] + number_names[n_div]["digits"]
)
connect_word, connect_syllables = " ", 0
# if n_mod < 100:
# connect_word, connect_syllables = " and ", 1
return (
number_names[n_div]["syllables"][1] + large_names[large_index][1] + connect_syllables + number_names[n_mod]["syllables"][1],
number_names[n_div]["names"][1] + " " + large_names[large_index][0] + connect_word + number_names[n_mod]["names"][1],
number_names[n_div]["syllables"][1] + large_names[large_index][1] + connect_syllables + number_names[n_mod]["syllables"][0],
number_names[n_div]["names"][1] + " " + large_names[large_index][0] + connect_word + number_names[n_mod]["names"][0],
number_names[n_mod]["zeroes"],
large_names[large_index][3] + number_names[n_div]["digits"]
)
def number_names_generator(leave_point,max_number,silly=True):
max_syllables = 0
for n in range(0,max_number + 1):
n_syllables, n_name, frac_syllables, frac_name, zeroes, digits = base_syllables(n)
adj_zeroes = zeroes
if zeroes > 3:
adj_zeroes = (zeroes // 3)*3
number_names.append(
{
"value": n,
"syllables": [frac_syllables] + [n_syllables]*(pemdas_count-1),
"names": [frac_name] + [n_name]*(pemdas_count-1),
"equations": [str(n)]*pemdas_count,
"original": n_syllables,
"zeroes": adj_zeroes,
"digits": digits,
"nonzero": digits-zeroes,
"auto pass": (n%100 < 20 and n%100 > 0) or zeroes < 1 or digits < 3,
}
)
max_syllables = max(max_syllables, n_syllables)
number_names[2]["syllables"][0] = 1
number_names[2]["names"][0] = "halve"
syllable_key = [[]]
for u in range(pemdas_count):
syllable_key[0].append([])
# pemdas indices: 0 ordinal, 1 original, 2 exponent, 3 multiplication, 4 division, 5 addition and subtraction
unary = [
{"id": "²", "syllables": 1, "text": " squared", "value": 2, "pemdas_input": 2,"pemdas_result": 2},
{"id": "³", "syllables": 1, "text": " cubed", "value": 3, "pemdas_input": 2,"pemdas_result": 2},
]
binary = [
{ "id": "+", "syllables": 1, "text": " plus ", "suffix": "", "pemdas_left": 5,"pemdas_right": 5,"pemdas_result": 5},
{ "id": "*", "syllables": 1, "text": " times ", "suffix": "", "pemdas_left": 3,"pemdas_right": 4,"pemdas_result": 4},
{ "id": "*", "syllables": 1, "text": " times ", "suffix": "", "pemdas_left": 3,"pemdas_right": 3,"pemdas_result": 3},
{ "id": "-", "syllables": 1, "text": " less ", "suffix": "", "pemdas_left": 5,"pemdas_right": 4,"pemdas_result": 5},
{ "id": "/", "syllables": 2, "text": " over ", "suffix": "", "pemdas_left": 3,"pemdas_right": 2,"pemdas_result": 4},
{ "id": "fraction", "syllables": 0, "text": " ", "suffix": "s", "pemdas_left": 2,"pemdas_right": 0,"pemdas_result": 2},
{ "id": "group", "syllables": 0, "text": " ", "suffix": "s", "pemdas_left": 3,"pemdas_right": 1,"pemdas_result": 3},
{ "id": "^", "syllables": 2, "text": " to the ", "suffix": "","pemdas_left": 2, "pemdas_right": 0,"pemdas_result": 2},
]
min_missing = 1
for s in range(1, max_syllables + 1):
print("searching", s, "syllables, at",min_missing)
syllable_key.append([])
for u in range(pemdas_count):
syllable_key[s].append([])
for n in range(min_missing,max_number+1):
for u in range(pemdas_count):
if number_names[n]["syllables"][u] < s:
break
if number_names[n]["syllables"][u] == s:
syllable_key[s][u].append(number_names[n]["value"])
elif u > 0:
break
for op in binary:
#print(op)
min_left, max_left = get_first_extremes(op, min_missing, max_number)
for left_syllables in range(s - op["syllables"]):
for left_value in syllable_key[left_syllables][op["pemdas_left"]]:
if left_value < min_left:
continue
if left_value > max_left:
break
min_right, max_right = get_second_extremes(op, min_missing, max_number, left_value)
for right_value in syllable_key[s - op["syllables"] - left_syllables][op["pemdas_right"]]:
if right_value < min_right:
continue
if right_value > max_right:
break
if (op["id"] == "fraction"
and not number_names[left_value]["auto pass"]
and right_value != 2
and number_names[left_value]["zeroes"] >= number_names[right_value]["digits"]
and (number_names[left_value]["nonzero"] > 1 or number_names[right_value]["nonzero"] > 1)
and number_names[left_value]["names"][1] == number_names[left_value]["names"][2]):
continue
elif op["id"] == "group" and right_value%10==6:
continue
op_output, valid_output = get_output(op, left_value, right_value)
if not valid_output:
continue
new_name = (number_names[left_value]["names"][op["pemdas_left"]]
+ op["text"]
+ number_names[right_value]["names"][op["pemdas_right"]]
+ op["suffix"])
new_equation = number_names[left_value]["equations"][op["pemdas_left"]]
if op["id"] == "^" and new_equation == number_names[left_value]["equations"][1]:
new_equation = new_equation + " " + superscripts[right_value]
elif op["id"] == "^":
new_equation = "(" + new_equation + ") " + superscripts[right_value]
else:
if op["id"] == "fraction":
new_equation += " / "
else:
new_equation += " " + op["id"] + " "
new_equation += number_names[right_value]["equations"][op["pemdas_right"]]
for u in range(op["pemdas_result"],pemdas_count):
if number_names[op_output]["syllables"][u] > s:
number_names[op_output]["names"][u] = new_name
number_names[op_output]["equations"][u] = new_equation
number_names[op_output]["syllables"][u] = s
syllable_key[s][u].append(op_output)
# To only replace current number name with sillier version
# of the same syllable length if silly=True
if silly and number_names[op_output]["syllables"][u] == s:
number_names[op_output]["names"][u] = new_name
number_names[op_output]["equations"][u] = new_equation
for op in unary:
#print(op)
if s <= op["syllables"]:
continue
min_value, max_value = get_first_extremes(op, min_missing, max_number)
for input_value in syllable_key[s - op["syllables"]][op["pemdas_input"]]:
if input_value < min_value:
continue
if input_value > max_value:
break
op_output, valid_output = get_output(op, input_value)
if not valid_output:
continue
new_name = number_names[input_value]["names"][op["pemdas_input"]] + op["text"]
new_equation = number_names[input_value]["equations"][op["pemdas_input"]]
for u in range(op["pemdas_result"],pemdas_count):
if number_names[op_output]["syllables"][u] > s:
number_names[op_output]["names"][u] = new_name
number_names[op_output]["equations"][u] = new_equation
number_names[op_output]["syllables"][u] = s
syllable_key[s][u].append(op_output)
# To only replace current number name with sillier version
# of the same syllable length if silly=True
if silly and number_names[op_output]["syllables"][u] == s:
number_names[op_output]["names"][u] = new_name
number_names[op_output]["equations"][u] = new_equation
for i in range(pemdas_count):
syllable_key[s][i].sort()
while number_names[min_missing]["syllables"][-1] <= s:
min_missing += 1
if min_missing > leave_point:
break
if min_missing > leave_point:
break
return number_names[0:leave_point+1]
def get_first_extremes(op,min_missing,max_number):
if op["id"] == "²":
return min_missing**(1/2), max_number**(1/2)
elif op["id"] == "³":
return min_missing**(1/3), max_number**(1/3)
elif op["id"] == "+":
return 6, max_number-1
elif op["id"] == "*" or op["id"] == "group":
return 2, max_number**0.5
elif op["id"] == "-":
return min_missing+1, max_number
elif op["id"] == "/" or op["id"] == "fraction":
return min_missing*2, max_number
elif op["id"] == "^":
return 2, max_number**0.2
def get_second_extremes(op,min_missing,max_number,left_value):
if op["id"] == "+":
return 1, min(left_value,max_number - left_value)
elif op["id"] == "*" or op["id"] == "group":
return max(left_value,min_missing/left_value), max_number/left_value
elif op["id"] == "-":
return 1, left_value-min_missing
elif op["id"] == "/" or op["id"] == "fraction":
return 2, left_value/2
elif op["id"] == "^":
return 5, math.log(max_number)/math.log(left_value)
def get_output(op,left_value,right_value=0):
if op["id"] == "²":
return left_value**2, True
if op["id"] == "³":
return left_value**3, True
elif op["id"] == "^":
return left_value**right_value, True
elif op["id"] == "+":
return left_value + right_value, True
elif op["id"] == "*" or op["id"] == "group":
return left_value * right_value, True
elif op["id"] == "-":
return left_value - right_value, True
elif op["id"] == "/" or op["id"] == "fraction":
if left_value % right_value == 0:
return left_value // right_value, True
return 0, False
def numbers_out(number_names, file_name, *args): # modified to be able to write silly+nonsilly to the same csv
with open(file_name,"w",encoding="utf-8") as f:
for index in range(len(number_names)):
l = number_names[index]
line = str(l["value"]) + "," + l["names"][-1] + "," + l["equations"][-1] + ","
for ar in args: # there should only be one extra argument (the silly version) for now, just failsafe-ing this a bit
if l["value"] != ar[index]["value"]: # if values do not match (this should not happen!)
print("Values do not match at index " + str(index) + ": "
+ str(l["value"]) + " vs " + str(ar[index]["value"]))
line += "Values do not match: " + str(ar[index]["value"]) + ","
break
if l["syllables"][-1] != ar[index]["syllables"][-1]: # if syllable lengths do not match (this should not happen!)
print("Syllables do not match at " + str(l["value"]) + ": "
+ l["names"][-1] + " vs " + ar[index]["names"][-1])
line += "Syllables do not match: "
line += ar[index]["names"][-1] + "," + ar[index]["equations"][-1] + ","
line += str(l["syllables"][-1]) +"\n"
f.write(line)
number_names = []
fast_numbers = number_names_generator(10000,100000)
number_names = []
fast_numbers_nonsilly = number_names_generator(10000,100000,False)
numbers_out(fast_numbers_nonsilly, 'fastest_numbers.csv', fast_numbers)