Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
Helpful solution in Creative category for The Brick Factory Problem by veky
f = lambda n, h = 2 .__rfloordiv__: h(n) * h(n-1)
def crosses(*args):
match args:
case [n]: return f(n) * f(n-2) // 4
case [k, s]: return f(k) * f(s)
Jan. 1, 2024
Comments: