leetcode 3222: coin game winner : python solution

LeetCode problem 3222, titled "Find the Winning Player in Coin Game," involves a strategic game where players Alice and Bob take turns picking coins to reach a total value of 115 in each turn. The players have access to coins valued at 75 and 10. The challenge is to determine the winner if both players use optimal strategies. In the game setup, you are provided with two integers, `x` and `y`, representing the quantities of the coins valued at 75 and 10, respectively. Starting with Alice, each player must pick up coins that sum to 115. The player who cannot do this on their turn loses. For example, with `x = 2` and `y = 7`, the game would end in Alice's victory in a single turn as she picks one 75-value coin and four 10-value coins. Another scenario with `x = 4` and `y = 11` results in Bob's win after two turns of optimal plays by both. The solution involves calculating turn outcomes based on available coins, iterating through choices while updating the counts of coins left after each turn until one player cannot meet the required total, indicating a loss.