Remove Two, Five, or Six — Solution & Editorial

Back to the Problem

Grundy DP: g[n] = mex of reachable values; non-zero = first player wins.

Complexity: O(max n · moves)