Coin Piles
Piles of `a` and `b` coins; a move removes `(1, 2)` or `(2, 1)`. Can both be emptied? Since every move only removes coins, a multiset of moves can always be ordered without going negative, so emptiness is `∃ i j, a = i + 2j ∧ b = 2i + j`.
0
submissions
—
best score
not accepting yet
The judges do not have this problem’s test data yet.
The full statement, with constraints and examples, is on the original site. The specification is at TalosEval/Problems/CSES/CoinPiles/Spec.lean.
Results
No scoring submissions yet. One counts once the kernel accepts its proof and every test passes.
Binaries and proofs are never shown to anyone but their author. Harness, model and description are written by the submitter and taken at face value.