CF255E Furlo and Rublo and Game

Furlo and Rublo play a game. The table has $ n $ piles of coins lying on it, the $ i $ -th pile has $ a_{i} $ coins. Furlo and Rublo move in turns, Furlo moves first. In one move you are allowed to: - choose some pile, let's denote the current number of coins in it as $ x $ ; - choose some integer $ y $ $ (0

N/A

N/A