Stone removal game
Your task
A single pile has n stones. On each turn a player must remove a number of stones equal to one of the allowed values in moves. Players alternate; the player who cannot move loses (normal play). With optimal play and the first player to move, return True if the first player wins.
Examples
subtraction_game_win(n: int, moves: list[int]) -> boolExample 1
Input
subtraction_game_win(10, [1, 3, 4])Output
True