2020-2021 ACM-ICPC Latin American Regional Programming Contest

14 problems from 2020-2021 ACM-ICPC Latin American Regional Programming Contest (contest 103185), difficulty -. 2/14 solutions verified against sample I/O.

14 items

2020-2021 ACM-ICPC Latin American Regional Programming Contest

ICPC/IOI | 14 problems | 2/14 verified | Difficulty - | 11m 50s

#	Problem	Time	✓
A	Almost Origami	2m 31s
B	Beautiful Mountains	36s
C	Crisis at the Wedding	35s
D	Dividing Candy	50s	✓
E	Excellent Views	47s	✓
F	Fascinating Partitions	31s
G	Game of Slots	29s
H	Halting Wolf	31s
I	Impenetrable Wall	31s
J	Job Allocator	2m 30s
K	Keylogger	27s
L	Lola's Schedule	35s
M	May I Add a Letter?	29s
N	Non-Integer Donuts	28s

Practice › Codeforces Solutions › 2020-2021 ACM-ICPC Latin American Regional Programming Contest ›

CF 103185J - Job Allocator

A canonical basis $(alpha1,ldots,alphat)$ in Exercise 12 is represented in this section as a selection of $t$ distinguished positions among $n$, equivalently as an $(s,t)$-combination with $n=s+t$, encoded by a binary string $a{n-1}ldots a1a0$ satisfying $sum ai=t$.

Practice › Codeforces Solutions › 2020-2021 ACM-ICPC Latin American Regional Programming Contest ›

CF 103185N - Non-Integer Donuts

I don’t have the actual statement of Codeforces 103185N - Non-Integer Donuts in your prompt, and without it I’d be forced to guess the problem structure, which would make the editorial unreliable.

Practice › Codeforces Solutions › 2020-2021 ACM-ICPC Latin American Regional Programming Contest ›

CF 103185L - Lola's Schedule

I can’t reliably write a correct editorial for this problem without seeing the actual statement. “Codeforces 103185L - Lola’s Schedule” isn’t included in your message, so I don’t know what the input represents, what is being optimized, or even the core task (it could…

Practice › Codeforces Solutions › 2020-2021 ACM-ICPC Latin American Regional Programming Contest ›

CF 103185M - May I Add a Letter?

The problem statement is missing from your prompt, so I don’t have enough information to write a correct editorial. Right now I only know the title “May I Add a Letter?”, but not: - what the input strings or data are - what operation “add a letter” refers to (insertion?

Practice › Codeforces Solutions › 2020-2021 ACM-ICPC Latin American Regional Programming Contest ›

CF 103185K - Keylogger

I don’t have the actual statement of Codeforces 103185K - Keylogger, and without it I’d be forced to guess the rules, which would make the editorial unreliable.

Practice › Codeforces Solutions › 2020-2021 ACM-ICPC Latin American Regional Programming Contest ›

CF 103185I - Impenetrable Wall

I don’t have the actual statement of Codeforces 103185I - Impenetrable Wall available in your prompt, and it’s not safe to reconstruct it from the title alone. To write a correct editorial, I need the full problem description, including input/output format and constraints.

Practice › Codeforces Solutions › 2020-2021 ACM-ICPC Latin American Regional Programming Contest ›

CF 103185H - Halting Wolf

I can’t write a correct editorial for this yet because the actual problem statement is missing. “Codeforces 103185H - Halting Wolf” isn’t enough on its own to reconstruct the task reliably, and anything I’d write without the full statement would be guesswork.

Practice › Codeforces Solutions › 2020-2021 ACM-ICPC Latin American Regional Programming Contest ›

CF 103185A - Almost Origami

Practice › Codeforces Solutions › 2020-2021 ACM-ICPC Latin American Regional Programming Contest ›

CF 103185G - Game of Slots

I can’t write a correct editorial for “Codeforces 103185G - Game of Slots” without the actual problem statement.

Practice › Codeforces Solutions › 2020-2021 ACM-ICPC Latin American Regional Programming Contest ›

CF 103185D - Dividing Candy

We are given a collection of candy boxes, where each box contains a number of candies that is a power of two. Instead of being given the actual counts directly, we are given exponents: the i-th box contains $2^{Ai}$ candies. Two brothers will split these boxes between them.

Practice › Codeforces Solutions › 2020-2021 ACM-ICPC Latin American Regional Programming Contest ›

CF 103185F - Fascinating Partitions

I’m missing the actual problem statement for Codeforces 103185F - Fascinating Partitions, so I can’t reliably reconstruct the task or derive a correct solution.

Practice › Codeforces Solutions › 2020-2021 ACM-ICPC Latin American Regional Programming Contest ›

CF 103185E - Excellent Views

We are given a one-dimensional landscape represented by heights along a line. Each position has a height, and we want to determine which positions are “excellent viewpoints”, meaning they can be seen in an unobstructed way from at least one direction under the natural…

Practice › Codeforces Solutions › 2020-2021 ACM-ICPC Latin American Regional Programming Contest ›

CF 103185B - Beautiful Mountains

I can’t write a correct editorial for Codeforces 103185B “Beautiful Mountains” without the actual problem statement. Right now the prompt is missing everything that defines the task: what the input represents, what “beautiful” means, and what needs to be computed.

Practice › Codeforces Solutions › 2020-2021 ACM-ICPC Latin American Regional Programming Contest ›

CF 103185C - Crisis at the Wedding

I can’t reliably write a correct editorial for CF 103185C - Crisis at the Wedding because the actual problem statement is missing from your prompt.