| CF Step |
|---|
| Private |
| Spectator |
→ Member management
You are not group member yet,
but can request group join.
Group Contests
| Name | Start | Length | ||
|---|---|---|---|---|
|
Stars and Bars
Enter » Virtual participation » |
- | 01:30 |
Prepared by adaptatron
|
|
|
Game Theory
Enter » Virtual participation » |
- | 01:30 |
Prepared by adaptatron
|
|
|
Subsequences and Data Structures
Enter » Virtual participation » |
- | 01:30 |
Prepared by adaptatron
|
|
|
1D DP
Enter » Virtual participation » |
- | 01:30 |
Prepared by adaptatron
|
|
|
Graph Modelling with Stack
Enter » Virtual participation » |
- | 01:30 |
Prepared by adaptatron
|
|
|
Xor, Modulo 4 and Set Bit Count
Enter » Virtual participation » |
- | 01:30 |
Prepared by adaptatron
|
|
|
Atcoder Library
Enter » Virtual participation » |
- | 01:30 |
Prepared by adaptatron
|
|
|
SOS DP
Enter » Virtual participation » |
- | 01:30 |
Prepared by adaptatron
|
|
|
Friendship Ended with Stack + Contribution Technique
Enter » Virtual participation » |
- | 01:30 |
Prepared by adaptatron
|
|
|
Time Complexity of Tree DP
Enter » Virtual participation » |
- | 01:30 |
Prepared by adaptatron
|
|
|
DP on Distinct Subsequences
Enter » Virtual participation » |
- | 05:00 |
Prepared by adaptatron
|
|
|
Balanced Parenthesis : Hidden Insights
Enter » Virtual participation » |
- | 05:00 |
Prepared by adaptatron
|
|
|
Push DP vs Pull DP
Enter » Virtual participation » |
- | 01:30 |
Prepared by adaptatron
|
|
|
Bitmasks and Bitmask DP
Enter » Virtual participation » |
- | 01:30 |
Prepared by adaptatron
|
|
|
Bitwise Operations
Enter » Virtual participation » |
- | 01:30 |
Prepared by adaptatron
|
|
|
Greedy Algorithms
Enter » Virtual participation » |
- | 01:30 |
Prepared by adaptatron
|
|
|
String Algorithms
Enter » Virtual participation » |
- | 05:00 |
Prepared by adaptatron
|
|
|
CP Lapse : Feb 2024
Enter » Virtual participation » |
- | 04:00 |
Prepared by adaptatron
|
|
|
Probability DP
Enter » Virtual participation » |
- | 01:30 |
Prepared by adaptatron
|
|
|
DP on Trees
Enter » Virtual participation » |
- | 01:30 |
Prepared by adaptatron
|
|
|
DP on Induced Subgraphs of a Tree
Enter » Virtual participation » |
- | 01:30 |
Prepared by adaptatron
|
|
|
Answering Queries Offline with Sweepline
Enter » Virtual participation » |
- | 01:30 |
Prepared by adaptatron
|
|
|
XOR is minimized for adjacent sorted elements
Enter » Virtual participation » |
- | 01:30 |
Prepared by adaptatron
|
|
|
DP on Spanning Subgraphs of a Tree
Enter » Virtual participation » |
- | 01:30 |
Prepared by adaptatron
|
|
|
Extending Binary Strings with DP
Enter » Virtual participation » |
- | 01:30 |
Prepared by adaptatron
|
|
|
Dijkstra is BFS in Disguise
Enter » Virtual participation » |
- | 01:30 |
Prepared by adaptatron
|
|
|
Distributing DP + SQRT Trick
Enter » Virtual participation » |
- | 01:30 |
Prepared by adaptatron
|
|
|
Timer on Trees
Enter » Virtual participation » |
- | 01:30 |
Prepared by adaptatron
|
|
|
DP + Sliding Window
Enter » Virtual participation » |
- | 01:30 |
Prepared by adaptatron
|
|
|
Montonic Stack + DP
Enter » Virtual participation » |
- | 01:30 |
Prepared by adaptatron
|
* Highlighted contests are not public
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Nov/09/2026 01:25:00 (f1).
Desktop version, switch to mobile version.
Supported by
