Game of Coders 3.0

13 problems from Game of Coders 3.0 (contest 105262), difficulty -. 13/13 solutions verified against sample I/O.

13 items

Game of Coders 3.0

Special | 13 problems | 13/13 verified | Difficulty - | 11m 56s

# Problem Rating Tags Accepted Time ✓
A The Problems Problem 1m 12s ✓
B Re-Indexing 49s ✓
C The Rectangular City 59s ✓
D The FFT Problem 1m 12s ✓
E Tim Game 1m 5s ✓
F Fibonacci Strings 49s ✓
G Symmetric Subarrays 53s ✓
H Hot Cappuccino 56s ✓
I The Vampire Partner 43s ✓
J Just One More Bro, I Swear 47s ✓
K The Red Tomato 47s ✓
L Growing Letters 56s ✓
M Maximum Subarray Alternating Sum 48s ✓
Practice › Codeforces Solutions › Game of Coders 3.0 ›

CF 105262D - The FFT Problem

We are trying to choose a numeric base for representing a given integer so that its representation contains the digit 4 at least once. Among all such bases in a given range, we want the largest one. Concretely, for each test case we receive a number $n$.
codeforces competitive-programming Jun 24, 2026
Practice › Codeforces Solutions › Game of Coders 3.0 ›

CF 105262M - Maximum Subarray Alternating Sum

We are given an array of integers and asked to choose a contiguous segment and compute a modified sum over it. Inside the chosen segment, the first element is added, the second is subtracted, the third is added again, and this alternation continues until the end of the segment.
codeforces competitive-programming Jun 24, 2026
Practice › Codeforces Solutions › Game of Coders 3.0 ›

CF 105262L - Growing Letters

We start with a construction that behaves like a recursively expanding string. Each number in the input array does not represent a single character directly; instead it defines a small string built from a fixed recursive rule.
codeforces competitive-programming Jun 24, 2026
Practice › Codeforces Solutions › Game of Coders 3.0 ›

CF 105262K - The Red Tomato

We are given several independent experiments. In each experiment there is a fixed positive integer threshold $w$, which is unknown but consistent across all experiments in the same test case.
codeforces competitive-programming Jun 24, 2026
Practice › Codeforces Solutions › Game of Coders 3.0 ›

CF 105262J - Just One More Bro, I Swear

The task describes a situation where a contest organizer decides how many problems are “hard” in a contest, and we are asked to determine the expected number of such hard problems when the total number of problems is fixed.
codeforces competitive-programming Jun 24, 2026
Practice › Codeforces Solutions › Game of Coders 3.0 ›

CF 105262I - The Vampire Partner

We are given several independent scenarios where a row of cups contains some hidden original amounts of cappuccino.
codeforces competitive-programming Jun 24, 2026
Practice › Codeforces Solutions › Game of Coders 3.0 ›

CF 105262H - Hot Cappuccino

We are given a grid representing a city split into n by m blocks. Each block may contain a coffee shop that offers cappuccino, hot chocolate, both drinks, or nothing.
codeforces competitive-programming Jun 24, 2026
Practice › Codeforces Solutions › Game of Coders 3.0 ›

CF 105262G - Symmetric Subarrays

We are given an integer array and we look at every possible contiguous subarray. For each subarray, we assign it a value based on a simple symmetry condition. If the subarray reads the same from left to right and right to left, we take the sum of its elements as its value.
codeforces competitive-programming Jun 24, 2026
Practice › Codeforces Solutions › Game of Coders 3.0 ›

CF 105262E - Tim Game

We are given a rooted tree with node 1 fixed as the root. Two players alternate moves, starting with the Secret Partner. A move consists of selecting any node other than the root and deleting that node together with every node in its subtree.
codeforces competitive-programming Jun 24, 2026
Practice › Codeforces Solutions › Game of Coders 3.0 ›

CF 105262F - Fibonacci Strings

We are given two base strings, call them $F1$ and $F2$, and we define a sequence of strings where every later string is formed by concatenating the previous two in order. So $F3 = F2 + F1$, $F4 = F3 + F2$, and so on.
codeforces competitive-programming Jun 24, 2026
Practice › Codeforces Solutions › Game of Coders 3.0 ›

CF 105262A - The Problems Problem

Each contestant faces a small set of at most 12 problems and has a fixed amount of time. They interact with the problems in a randomized way: instead of choosing an order in advance, they repeatedly pick uniformly among the remaining unused problems.
codeforces competitive-programming Jun 24, 2026
Practice › Codeforces Solutions › Game of Coders 3.0 ›

CF 105262C - The Rectangular City

The grid describes a city where every cell has a letter label representing its type. Moving inside the city is constrained in a peculiar way: direct movement is not allowed between arbitrary cells. Instead, movement is always split into two phases.
codeforces competitive-programming Jun 24, 2026
Practice › Codeforces Solutions › Game of Coders 3.0 ›

CF 105262B - Re-Indexing

We are given a book where each chapter has two attributes: a unique title and a unique starting page number. In a correct book, the chapters would be ordered by increasing starting page number, since that represents the actual reading order.
codeforces competitive-programming Jun 24, 2026