Winter Cup 8.0 Online Mirror Contest

14 problems from Winter Cup 8.0 Online Mirror Contest (contest 106415), difficulty -. 8/14 solutions verified against sample I/O.

14 items

Winter Cup 8.0 Online Mirror Contest

Special | 14 problems | 8/14 verified | Difficulty - | 7m 58s

#	Problem	Time	✓
A	A day in Baladeya	55s	✓
B	Breaking Bad	35s	✓
C	Aziza Supermarket Heist	37s	✓
D	Sousse	33s	✓
E	Game of Divisors	25s
F	The Carthaginian Cipher	25s
G	Derby	30s
H	Scratch Expressions	44s	✓
I	Array Tounsi	22s
J	The Lake of Ichkeul	18s
K	The Encrypted Parchment	27s
L	Drone Route Planning	37s	✓
M	Hiya Ti7 Wena Ntala3ha	45s	✓
N	Ons Jabeur and the Perfect Consistency	45s	✓

Practice › Codeforces Solutions › Winter Cup 8.0 Online Mirror Contest ›

CF 106415N - Ons Jabeur and the Perfect Consistency

We are given an array of integers representing “ratings” on a line of tennis balls. In one move, we are allowed to pick a single position and overwrite its value, but the new value is not arbitrary.

Practice › Codeforces Solutions › Winter Cup 8.0 Online Mirror Contest ›

CF 106415M - Hiya Ti7 Wena Ntala3ha

The problem describes a decreasing process on an integer value x. We start at S, and there are N possible moves. A move has an allowed interval [li, ri] and a decrease value di. When the current value is inside that interval, we may subtract di.

Practice › Codeforces Solutions › Winter Cup 8.0 Online Mirror Contest ›

CF 106415L - Drone Route Planning

The city is a directed weighted graph. A drone starts at a given hub, can fly along directed routes, and every route has an energy cost.

Practice › Codeforces Solutions › Winter Cup 8.0 Online Mirror Contest ›

CF 106415K - The Encrypted Parchment

I can’t write a correct, detailed editorial for Codeforces 106415K - The Encrypted Parchment without the actual problem statement.

Practice › Codeforces Solutions › Winter Cup 8.0 Online Mirror Contest ›

CF 106415H - Scratch Expressions

We need count how many strings of a given length form a valid arithmetic expression whose value is 0 modulo m. The original string is generated uniformly from an alphabet of 15 characters: digits, three binary operators, and two parentheses.

Practice › Codeforces Solutions › Winter Cup 8.0 Online Mirror Contest ›

CF 106415J - The Lake of Ichkeul

I can write the editorial, but I need the actual problem statement details for Codeforces 106415J - The Lake of Ichkeul.

Practice › Codeforces Solutions › Winter Cup 8.0 Online Mirror Contest ›

CF 106415I - Array Tounsi

Sure-please send the full problem statement (or a link), and if possible also include constraints and any sample input/output.

Practice › Codeforces Solutions › Winter Cup 8.0 Online Mirror Contest ›

CF 106415G - Derby

I can write the editorial, but I need the actual problem statement for Codeforces 106415G - Derby first. I could not reliably identify this problem from the title and ID alone, and I do not want to invent the algorithm, constraints, examples, or edge cases.

Practice › Codeforces Solutions › Winter Cup 8.0 Online Mirror Contest ›

CF 106415F - The Carthaginian Cipher

Sure-send me the problem statement (or link/text), and I’ll write a full Codeforces-style editorial. If you want, you can also tell me the difficulty level or intended techniques (DP, graphs, greedy, etc.), and I’ll match the depth and style accordingly.

Practice › Codeforces Solutions › Winter Cup 8.0 Online Mirror Contest ›

CF 106415D - Sousse

We have a complete binary task tree. The root task is available at the beginning. Whenever a task is processed, its two children become available for future processing. There are p processors, so during one time moment we can complete at most p currently available tasks.

Practice › Codeforces Solutions › Winter Cup 8.0 Online Mirror Contest ›

CF 106415E - Game of Divisors

Sure. Please provide the Codeforces problem statement (or a link, title, and constraints), and I’ll write a detailed editorial in a competitive programming style.

Practice › Codeforces Solutions › Winter Cup 8.0 Online Mirror Contest ›

CF 106415A - A day in Baladeya

We are given a circular system of agents, indexed from 0 to N-1. A ticket machine dispatches arriving citizens in a deterministic pattern: the i-th citizen is always sent to agent (S + i·K) mod N, where S is a starting offset and K is a step size.

Practice › Codeforces Solutions › Winter Cup 8.0 Online Mirror Contest ›

CF 106415C - Aziza Supermarket Heist

The task asks us to create a sequence of positive integers that can act as a valid security key. For a given length n, we need to print n numbers where the total value obtained by adding all numbers is exactly the same as the value obtained by multiplying all numbers together.

Practice › Codeforces Solutions › Winter Cup 8.0 Online Mirror Contest ›

CF 106415B - Breaking Bad

We have a connected country represented as an undirected graph. Each city is a vertex and each road is an edge. A road can already be working or it can be broken. The goal is to travel from city 1 to city n using only working roads after making some changes.