Dasha Code Championship - Novosibirsk Finals Round (only for onsite-finalists)
2 problems from Dasha Code Championship - Novosibirsk Finals Round (only for onsite-finalists) (contest 1231), difficulty 1100-2200. 0/2 solutions verified against sample I/O.
Dasha Code Championship - Novosibirsk Finals Round (only for onsite-finalists)
Special | 2 problems | 0/2 verified | Difficulty 1100-2200 | 4m 8s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| C | Increasing Matrix | 1100 | greedy | 4,362 | 2m 6s | |
| E | Middle-Out | 2200 | constructive-algorithms, greedy, strings | 932 | 2m 2s |
Practice
›
Codeforces Solutions
›
Dasha Code Championship - Novosibirsk Finals Round (only for onsite-finalists)
›
CF 1231C - Increasing Matrix
We are given a rectangular grid of integers. Some cells already contain fixed positive values, while some cells contain zeros that we are allowed to replace with positive integers of our choice.
Practice
›
Codeforces Solutions
›
Dasha Code Championship - Novosibirsk Finals Round (only for onsite-finalists)
›
CF 1231E - Middle-Out
We are given two strings of equal length. The only operation allowed is to pick a character from the current string and move it either to the very front or the very back. Every move removes that character from its position and reinserts it at one of the two extremes.