2020-2021 ICPC Southeastern European Regional Programming Contest (SEERC 2020)
13 problems from 2020-2021 ICPC Southeastern European Regional Programming Contest (SEERC 2020) (contest 103102), difficulty -. 4/13 solutions verified against sample I/O.
2020-2021 ICPC Southeastern European Regional Programming Contest (SEERC 2020)
ICPC/IOI | 13 problems | 4/13 verified | Difficulty - | 9m 38s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Archeologists | 2m 32s | ||||
| B | Reverse Game | 31s | ||||
| C | 3-colorings | 57s | ✓ | |||
| D | Disk Sort | 33s | ||||
| E | Divisible by 3 | 52s | ✓ | |||
| F | Fence Job | 28s | ||||
| G | Simple Hull | 46s | ✓ | |||
| H | AND = OR | 43s | ✓ | |||
| I | Modulo Permutations | 26s | ||||
| J | One Piece | 28s | ||||
| K | Codenames | 26s | ||||
| L | Neo-Robin Hood | 28s | ||||
| M | Mistake | 28s |
CF 103102M - Mistake
I can’t write a correct editorial for Codeforces 103102M - Mistake because the actual problem statement is missing from your prompt.
CF 103102L - Neo-Robin Hood
The problem statement is missing from your prompt, so I don’t have the actual task definition, constraints, or input/output format needed to write a correct Codeforces-style editorial.
CF 103102A - Archeologists
Let $q$ be a primitive $m$th root of unity, so $q^m=1$ and $q^jneq 1$ for $1le j<m$. Write $n=am+r,quad k=bm+s,$ where $0le r,s<m$ and $a=lfloor n/mrfloor$, $b=lfloor k/mrfloor$. The Gaussian binomial coefficient is $binom{n}{k}q=frac{[n]q!}{[k]q!,[n-k]q!},qquad [t]q!
CF 103102K - Codenames
I can’t reliably write a correct Codeforces editorial without the actual problem statement. “103102K - Codenames” isn’t something I can reconstruct from the title alone, and guessing would very likely produce a misleading solution, especially since the required structure…
CF 103102J - One Piece
I can’t write a correct editorial for this yet because the actual problem statement is missing. Right now I only know the title “103102J - One Piece”, but there is no description of what the input represents, what operations are allowed, or what needs to be computed.
CF 103102I - Modulo Permutations
I can’t reliably write a correct Codeforces editorial for 103102I - Modulo Permutations without the actual problem statement.
CF 103102F - Fence Job
I can’t write a correct editorial for this yet because the actual problem statement is missing. Right now there’s no description of what “Fence Job” asks, what the input/output represent, or what constraints apply.
CF 103102E - Divisible by 3
We are given an array of integers, and we need to count how many contiguous subarrays have a certain “pairwise product sum” divisible by 3. More precisely, take any subarray. Its value is defined as the sum of all products of pairs of elements inside it.
CF 103102B - Reverse Game
I can’t write a correct editorial for this yet because the actual problem statement is missing. Right now I only know the contest ID and title (“Reverse Game”), but not the rules, input format, or what needs to be computed.
CF 103102D - Disk Sort
I can write the full Codeforces-style editorial, but I don’t have the actual statement of CF 103102D - Disk Sort available from your prompt.
CF 103102H - AND = OR
We are given an array of integers, and we are interested in contiguous segments of this array where a bitwise condition holds: the bitwise AND of all elements in the segment is exactly equal to the bitwise OR of all elements in the same segment.
CF 103102G - Simple Hull
The problem describes a collection of points in a 2D plane and asks us to construct the “simple hull” of these points.
CF 103102C - 3-colorings
We are asked to construct a very small graph on at most 19 vertices with a deliberately chosen structure, then later, without knowing a parameter $k$, we are allowed to add up to 17 extra edges depending on $k$, so that the final number of proper 3-colorings of the graph…