Game of Coders 4 - Over the Garden Wall

15 problems from Game of Coders 4 - Over the Garden Wall (contest 106015), difficulty -. 15/15 solutions verified against sample I/O.

15 items

Game of Coders 4 - Over the Garden Wall

Special | 15 problems | 15/15 verified | Difficulty - | 15m 36s

#	Problem	Time	✓
A	Welcome to the Unknown: An Over The Garden Wall Adventure!	43s	✓
B	Adhoom and Halzoom Peculiar Pact	1m 49s	✓
C	The Whispering Tree's Path	1m 3s	✓
D	The Beast's Shadowy Game	1m 15s	✓
E	The Beast's Encoded Grid	57s	✓
F	The Spirit-Oak's Resonance	59s	✓
G	The Unseen Geometry of the Unknown	57s	✓
H	Whispers of Light in the Unknown	46s	✓
I	The Auntie Whispers' Labyrinth	57s	✓
J	Halzoom's Coffee Grid	1m 6s	✓
K	Roads of the Goose	1m 10s	✓
L	Gamal's Final Riddle	57s	✓
M	Halzoom's strange feeding system	50s	✓
N	The Squirrel's Scattered Nuts	47s	✓
O	The Echoing Scroll of Fate	1m 20s	✓

Practice › Codeforces Solutions › Game of Coders 4 - Over the Garden Wall ›

CF 106015O - The Echoing Scroll of Fate

We are given a mutable string that represents a “scroll”. Over a sequence of operations, we repeatedly select a substring and inspect its internal repetition structure.

Practice › Codeforces Solutions › Game of Coders 4 - Over the Garden Wall ›

CF 106015N - The Squirrel's Scattered Nuts

We are given a collection of integers, each representing the “energy” of a nut. The task is to choose two distinct nuts such that the sum of their energies is odd, and among all such valid pairs, return the maximum possible sum.

Practice › Codeforces Solutions › Game of Coders 4 - Over the Garden Wall ›

CF 106015M - Halzoom's strange feeding system

We are simulating a layered feeding system where food values grow over time across a line of cats. There are $M$ cats in a row and $N$ days. On the first day, every cat starts with exactly 1 gram of food.

Practice › Codeforces Solutions › Game of Coders 4 - Over the Garden Wall ›

CF 106015J - Halzoom's Coffee Grid

The grid represents a field of values, where each cell contains a non-negative number describing a “smell strength”.

Practice › Codeforces Solutions › Game of Coders 4 - Over the Garden Wall ›

CF 106015L - Gamal's Final Riddle

We are given several independent test cases. In each one, there is an array of integers, and we must count how many pairs of indices produce a special condition based on the least common multiple of the two values.

Practice › Codeforces Solutions › Game of Coders 4 - Over the Garden Wall ›

CF 106015I - The Auntie Whispers' Labyrinth

We are given a graph where intersections are nodes and streets are undirected edges. Each edge has a success probability expressed as a percentage, meaning if you traverse that street you survive with that probability and fail with the complementary risk.

Practice › Codeforces Solutions › Game of Coders 4 - Over the Garden Wall ›

CF 106015H - Whispers of Light in the Unknown

We are given a collection of N pieces of magical moss, where each piece contributes a fixed number of hours of light once used in the lantern.

Practice › Codeforces Solutions › Game of Coders 4 - Over the Garden Wall ›

CF 106015G - The Unseen Geometry of the Unknown

We are given an isosceles triangle described only by its geometric parameters: the two equal sides have length $L$, and the base has length $B$.

Practice › Codeforces Solutions › Game of Coders 4 - Over the Garden Wall ›

CF 106015F - The Spirit-Oak's Resonance

We are given a static array of integers, where each position represents a Spirit-Oak and its resonance value. After the array is fixed, we must answer many independent queries.

Practice › Codeforces Solutions › Game of Coders 4 - Over the Garden Wall ›

CF 106015E - The Beast's Encoded Grid

We are given a rectangular grid of lowercase letters and an additional “target” string. The target string defines required letter counts: for each character, we must know how many times it appears in that string.

Practice › Codeforces Solutions › Game of Coders 4 - Over the Garden Wall ›

CF 106015B - Adhoom and Halzoom Peculiar Pact

We are given a very large interval $[L, R]$, and we want to count pairs $(a, b)$ such that both numbers lie in this interval and $a le b$. The real restriction is a bit unusual: it connects modular arithmetic with a bitwise expression.

Practice › Codeforces Solutions › Game of Coders 4 - Over the Garden Wall ›

CF 106015D - The Beast's Shadowy Game

We are given a multiset that initially contains an even number $N$ of identical values, all equal to 1. Two players manipulate this multiset in turns. In each round, Player A removes two arbitrary numbers from the multiset.

Practice › Codeforces Solutions › Game of Coders 4 - Over the Garden Wall ›

CF 106015C - The Whispering Tree's Path

We are given a tree with up to 500,000 nodes. Each node stores a single digit from 1 to 9. The tree is rooted at node 0, but the root only matters for structure, not for direction of traversal. The task is to choose any two nodes and consider the unique simple path between them.

Practice › Codeforces Solutions › Game of Coders 4 - Over the Garden Wall ›

CF 106015K - Roads of the Goose

We are given a weighted undirected graph with $N$ towns and $M$ roads. Each road connects two towns and has a travel cost. The original graph is the full road system.

Practice › Codeforces Solutions › Game of Coders 4 - Over the Garden Wall ›

CF 106015A - Welcome to the Unknown: An Over The Garden Wall Adventure!

The task is intentionally simple: the program receives a single line of input that represents an opening message from a fictional setting. Regardless of the exact wording or formatting of this line, the required behavior never changes.