Viewing other problems with insights similar to only this insight from Codeforces 1860C: Game on Permutation:
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
-
Codeforces 1746D: Paths on the Tree
Shared similar insights
- Take advantage when there are TWO choices available for some objects. This can be an indication to use DP. Consider storing the difference between the two choices and sorting to determine the optimal choices. by mathmastersd
- 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
- View ALL insights of this problem that are shared
-
Codeforces 1506F: Triangular Paths
Shared similar insights
- When dealing with even/odd numbers in a problem, see if the moves are designed for numbers to stay odd or stay even. In general, check in a problem if some characteristic is always the same (e.g. number being even). by mathmastersd
- Try to do the moves that are advantageous first to work to a desired result and then finish the rest of the moves to get a desired result (greedy strategy). by mathmastersd
- View ALL insights of this problem that are shared
-
Codeforces 1801D: The way home
Shared similar insights
- Use Dynamic programming and djikstra algorithm by pranav_02
- View ALL insights of this problem that are shared
-
Codeforces 1370D: Odd-Even Subsequence
Shared similar insights
- When choosing elements from a list whose indices MUST have certain separation, consider using dynamic programming (DP). by mathmastersd
- View ALL insights of this problem that are shared
Page 1 of 1.
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