Glasses are arranged in a pyramid where the $0^{th}$ row contains $1$ glass, the $1^{st}$ row contains $2$ glasses, and in general, the $r^{th}$ row contains $r + 1$ glasses. Each glass can hold a maximum of $1$ cup of champagne.

Champagne is poured into the top glass at index $(0, 0)$. Once a glass becomes completely full, any excess liquid spills over equally into the two glasses directly beneath it: index $(r + 1, c)$ and index $(r + 1, c + 1)$. When those glasses become full, the excess continues to fall evenly into the glasses below them, and this process repeats down the tower.

Given the total amount of liquid poured, return the amount of champagne in the glass located at index (query_row, query_glass).

Constraints:

• $0 \leq$ poured $\leq 10^9$

• $0 \leq$ query_glass $\leq$ query_row $< 100$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.