2020-2021 Summer Petrozavodsk Camp, Day 6: Korean Contest

11 problems from 2020-2021 Summer Petrozavodsk Camp, Day 6: Korean Contest (contest 102984), difficulty -. 1/11 solutions verified against sample I/O.

11 items

2020-2021 Summer Petrozavodsk Camp, Day 6: Korean Contest

Special | 11 problems | 1/11 verified | Difficulty - | 7m 51s

# Problem Rating Tags Accepted Time ✓
A Mango 35s
B Koosaga's Problem 2m 38s
C Gardening Game 55s ✓
D Non-Decreasing Subarray Game 31s
E Observer Game 26s
F Rhythm Game 27s
G Solo Tree Game 25s
H Stone Catch Game 31s
I Selecting Points and Segments 24s
J Setting Maps 34s
K Determinant 25s
Practice › Codeforces Solutions › 2020-2021 Summer Petrozavodsk Camp, Day 6: Korean Contest ›

CF 102984J - Setting Maps

The problem statement for Codeforces 102984J - Setting Maps is missing from your prompt, so there is no way to correctly reconstruct the solution, constraints, or intended algorithm.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › 2020-2021 Summer Petrozavodsk Camp, Day 6: Korean Contest ›

CF 102984B - Koosaga's Problem

Let $T(m1,dots,m{n-1},m)$ be the $(n)$-dimensional torus equipped with cross order. Write elements as $(y,a)$ where $y in T(m1,dots,m{n-1})$ and $0 le a < m$ denotes the final component.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › 2020-2021 Summer Petrozavodsk Camp, Day 6: Korean Contest ›

CF 102984K - Determinant

I can’t reliably write an editorial for this yet because the actual problem statement is missing. “Codeforces 102984K - Determinant” is just a title here, and different determinant problems on Codeforces vary a lot in structure, even if they share the same name.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › 2020-2021 Summer Petrozavodsk Camp, Day 6: Korean Contest ›

CF 102984I - Selecting Points and Segments

I don’t have the actual statement of Codeforces 102984I - Selecting Points and Segments, and without it I’d be forced to invent the problem structure, which would make the editorial meaningless or incorrect.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › 2020-2021 Summer Petrozavodsk Camp, Day 6: Korean Contest ›

CF 102984H - Stone Catch Game

I can’t write a correct editorial for this yet because the actual problem statement for Codeforces 102984H - Stone Catch Game is missing.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › 2020-2021 Summer Petrozavodsk Camp, Day 6: Korean Contest ›

CF 102984G - Solo Tree Game

I can’t write a correct editorial for this yet because the actual problem statement is missing. Right now I only know the title, “Solo Tree Game,” but there’s no information about what the tree game rules are, what inputs are given, or what needs to be computed.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › 2020-2021 Summer Petrozavodsk Camp, Day 6: Korean Contest ›

CF 102984F - Rhythm Game

I can’t reliably write a correct Codeforces editorial here because the actual problem statement for 102984F - Rhythm Game is missing from your prompt.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › 2020-2021 Summer Petrozavodsk Camp, Day 6: Korean Contest ›

CF 102984E - Observer Game

I can’t write a correct editorial for this yet because the actual problem statement is missing. Right now we only have the title “Observer Game”, but no description of the rules, inputs, or outputs.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › 2020-2021 Summer Petrozavodsk Camp, Day 6: Korean Contest ›

CF 102984D - Non-Decreasing Subarray Game

The problem statement isn’t included, so I can’t reliably reconstruct the task or produce a correct editorial. “Non-Decreasing Subarray Game” could correspond to multiple different CF-style mechanics (range queries, segment operations, game DP, etc.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › 2020-2021 Summer Petrozavodsk Camp, Day 6: Korean Contest ›

CF 102984C - Gardening Game

We are given an $N times N$ grid of unit cells, all starting with beauty value zero. The system evolves through three kinds of operations applied over time. First, we may introduce horizontal or vertical cut lines across the grid.
codeforces competitive-programming Jul 4, 2026
Practice › Codeforces Solutions › 2020-2021 Summer Petrozavodsk Camp, Day 6: Korean Contest ›

CF 102984A - Mango

I can’t produce a correct editorial for “Codeforces 102984A - Mango” yet because the actual problem statement is missing from your prompt.
codeforces competitive-programming Jul 4, 2026