create a golfed down regexp that matches all substrings
inspired by Determine the "Luck" of a string where I found a way to golf almost 30 bytes at once.
The word "lucky" contains 15 different substrings:
lucky
luck, ucky
luc, uck, cky
lu, uc, ck, ky
l, u, c, k, y
Challenge
Create a program...
i.e each byte appears in a different ANSI shell colour.
Rules
Must be output in STDOUT or the primary colour text output of your language.
Must be done programmatically (with iteration) instead of just writing a fixed string to shell like the reference command.
Must output the same as the ref...
Graham's number is an unimaginably large number that is an upper bound on the solution to a certain problem in Ramsey theory. It is named after mathematician Ronald Graham who used the number as a simplified explanation of the upper bounds of the problem he was working on in conversations with popular science writer Martin Gardner. Gardner later described the number in Scientific American in 1977, introducing it to the general public. The number was published in the 1980 Guinness Book of World Records which added to the popular interest in the number.
Graham's number, although smaller than TREE...
TLDR: Python precomputes constants in the code. If any very large number is calculated with at least one intermediate step, the process will be CPU time limited.
It took quite a bit of searching, but I have discovered evidence that Python 3 does precompute constant literals that it finds in th...
