HolgerTDittmann

joined 2 years ago
sorted by: new top controversial old
F(nachos) = F(nachos-1) + F(nachos-2) [[email protected]] in c/[email protected]
[–] [email protected] 1 points 10 months ago* (last edited 10 months ago)

Nice party game, who can eat the highest Fibonacho number of nachos.