CodeSmash 2021 by RAPL

12 problems from CodeSmash 2021 by RAPL (contest 104246), difficulty -. 6/12 solutions verified against sample I/O.

12 items

CodeSmash 2021 by RAPL

Special | 12 problems | 6/12 verified | Difficulty - | 16m 13s

#	Problem	Time	✓
A	AI vs Programmers	57s	✓
B	Bugaboo from Sonadighir Mor	2m 3s
C	Cave & Tommy	1m 41s	✓
D	Distribute the Pizza	1m 23s
E	Eren's GCD Questions	1m 21s	✓
F	Find Rewards from RAPL	1m 20s
G	Grid Walk	1m 2s	✓
H	How Far have You been?	1m	✓
I	Interesting Pairs	1m 27s
J	Just a Magic Number	1m 25s
K	Knight, Read The Problem Statement Carefully	1m 2s	✓
L	Let Find The Line	1m 32s

Practice › Codeforces Solutions › CodeSmash 2021 by RAPL ›

CF 104246L - Let Find The Line

We are dealing with a hidden interval on a numbered line from 1 to N. Somewhere on this line there is a contiguous segment starting at A and ending at B, and our goal is to determine its length, which is B minus A plus one. We do not get direct access to A or B.

Practice › Codeforces Solutions › CodeSmash 2021 by RAPL ›

CF 104246J - Just a Magic Number

We are repeatedly transforming a small integer by a digit-rearrangement operation. Each step takes the current value, normalizes it to a 4-digit string using leading zeros, then forms two new numbers from its digits: one with digits sorted in ascending order and one in…

Practice › Codeforces Solutions › CodeSmash 2021 by RAPL ›

CF 104246K - Knight, Read The Problem Statement Carefully

The story talks about minimum spanning trees and color transformations, but the actual structure of the input is much simpler than the narrative suggests. What we truly receive is a connected undirected weighted graph with n vertices and m edges.

Practice › Codeforces Solutions › CodeSmash 2021 by RAPL ›

CF 104246I - Interesting Pairs

We are asked to count how many integer pairs $(a, b)$ exist inside a fixed interval $[l, r]$ such that $l le a le b le r$ and a specific relationship between $a$ and $b$ holds: the ratio between their least common multiple and greatest common divisor is exactly $k$.

Practice › Codeforces Solutions › CodeSmash 2021 by RAPL ›

CF 104246G - Grid Walk

We are given a grid where some cells are blocked and the rest are free. On this grid, several robots are placed. Each robot occupies exactly one free cell and has an orientation, one of four directions: left, right, up, or down. Time evolves in discrete steps.

Practice › Codeforces Solutions › CodeSmash 2021 by RAPL ›

CF 104246B - Bugaboo from Sonadighir Mor

We are given an array and we look at every contiguous segment of length at least two. For each chosen segment, we ignore its original order and instead sort its values. Once sorted, we compute the gaps between consecutive elements.

Practice › Codeforces Solutions › CodeSmash 2021 by RAPL ›

CF 104246D - Distribute the Pizza

A pizza is cut into identical slices, and each slice is a sector defined by a fixed central angle θ. The radius r is irrelevant for the distribution question because all slices are congruent; what matters is only how many equal angular pieces the full 360° circle is…

Practice › Codeforces Solutions › CodeSmash 2021 by RAPL ›

CF 104246F - Find Rewards from RAPL

We are given a collection of coders, each starting with some initial reward value. Over time, a sequence of updates arrives, and each update targets exactly one coder and increases that coder’s reward by some integer, which may be positive or negative.

Practice › Codeforces Solutions › CodeSmash 2021 by RAPL ›

CF 104246H - How Far have You been?

We are simulating a single move in a simplified board game. The board has 100 cells arranged in a path, and Farha is currently fixed at cell 94. She rolls a die once, producing an integer k between 1 and 6, and immediately moves forward k steps, landing on cell 94 + k.

Practice › Codeforces Solutions › CodeSmash 2021 by RAPL ›

CF 104246E - Eren's GCD Questions

We are given a tree of cities. Each city has a value, and every pair of cities is connected by a unique simple path.

Practice › Codeforces Solutions › CodeSmash 2021 by RAPL ›

CF 104246C - Cave & Tommy

We are given several independent queries. Each query provides a target number x and an interval of integers [l, r]. Inside this interval we want to know whether we can pick three distinct integers a < b < c, all lying in [l, r], such that their product equals x.

Practice › Codeforces Solutions › CodeSmash 2021 by RAPL ›

CF 104246A - AI vs Programmers

The problem removes all typical competitive programming structure and replaces it with a direct question. There is no input, no parameters, and no hidden state to compute from.