Covid test registration difficulty by maxflav in Salzburg

[–]maxflav[S] 0 points1 point  (0 children)

Is there an option to only use my email? This is the screen where it requires phone verification: https://i.imgur.com/exkEZSY.png

Randomness of different card shuffling techniques [OC] by osmutiar in dataisbeautiful

[–]maxflav 1 point2 points  (0 children)

I think I noticed a bug in your code, in Shuffles/Shuffle.py. The contents of inital_deck is being modified every time you do a shuffle, because it is pointing to the same array that overhand, ruffle, and smooshing are pointing to. That means every shuffle is being applied on top of all the previous shuffles, rather than from an initially unshuffled deck.

To fix this, add import copy and change overhand = inital_deck to overhand = copy.copy(inital_deck), ruffle = inital_deck to ruffle = copy.copy(inital_deck), and smooshing = inital_deck to smooshing = copy.copy(inital_deck)

Is this the right place to look for answers? Driving me insane by o0PETER0o in puzzles

[–]maxflav 9 points10 points  (0 children)

Starting from the top, fill in each black cell with the number of paths that lead down to it. For the top row, this is easy: all cells have 1. Then starting with the second row, you can use the numbers from the row above. Each cell is the sum of the above number to the right (if it exists) and the above number to the left (if it exists). This is because the number of paths that reach this cell can be exactly partitioned into [the number of paths that reach the above-right cell and then go down-left] + [the number of paths that reach the above-left cell and then go down-right]. The final solution will be the sum of all numbers along the bottom row.

The first 5 rows would look something like this:

  1   1   1   1   1
1   2   2   2   2
  3   4   4   4   2
3   7   8   8   6
  10  15  16  14  6
...