Viewing insights from Codeforces 1860C: Game on Permutation that are similar (thus shared) with only this insight from Codeforces 1746D: Paths on the Tree: A greedy strategy for graphs (and probably more generally) is to first take care of things at the bottom that will NOT affect others. Then, work your way upwards. by mathmastersd
- Iterate through the indices 1 to n, storing the winning and losing positions. Remember that a position is winning when it can move to a losing position, or when it has no moves. by Solarion
View links to all pages
1About • Privacy Notice • Rules • Problems list • Journal • Your profile • GitHub
Moon Symbol icon by Icons8 • Sun icon by Icons8 • Emojis from Twemoji by Twitter under CC by 4.0