CF Step |
---|

Private |

Spectator |

- Push DP vs Pull DP
- Bitmasks and Bitmask DP
- Bitwise Operations
- Greedy Algorithms
- String Algorithms
- CP Lapse : Feb 2024
- Probability DP
- DP on Trees
- DP on Induced Subgraphs of a Tree
- Answering Queries Offline with Sweepline
- XOR is minimized for adjacent sorted elements
- DP on Spanning Subgraphs of a Tree
- Extending Binary Strings with DP
- Dijkstra is BFS in Disguise
- Distributing DP + SQRT Trick
- Timer on Trees
- DP + Sliding Window
- Montonic Stack + DP

DP on Trees |
---|

Finished |

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

Want to solve the contest problems after the official contest ends? Just register for practice and you will be able to submit solutions.

Codeforces (c) Copyright 2010-2024 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/30/2024 06:22:21 (k3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|