Teamscode Spring 2023 Contest

18 problems from Teamscode Spring 2023 Contest (contest 104287), difficulty -. 13/18 solutions verified against sample I/O.

18 items

Teamscode Spring 2023 Contest

Special | 18 problems | 13/18 verified | Difficulty - | 26m 24s

# Problem Rating Tags Accepted Time ✓
A Are you busy? 1m 5s
B Mountain Climbing Easy 1m 8s ✓
C No Sweep 1m ✓
D Multiplication Table 1m 12s ✓
E Cyclic Shifts 1m 29s
F Greatest Common Mutiple 1m 23s ✓
G Daggers 3m 24s ✓
H A Certain Scientific Tree Problem 1m 16s ✓
I Mountain Climbing Hard 1m 39s
J Two and Three 1m 13s ✓
K That Time I Got Reincarnated As A String Problem 1m 11s ✓
L Stuck on Bricks 1m 33s ✓
M Magic labyrinth 1m 23s ✓
N The Tree Problem Is Done For 1m 51s
O Prefix queries 1m 16s ✓
P In Another World With My Range Query Problems 1m 30s ✓
Q Another Floors Problem 1m 43s
R Bingo 1m 8s ✓
Practice › Codeforces Solutions › Teamscode Spring 2023 Contest ›

CF 104287Q - Another Floors Problem

We are given a fixed list of positive integers $a1, a2, dots, an$. For any real number $x$, we form a value by taking each $ai x$, rounding it down to the nearest integer, and summing all these values. This produces a function $F(x)$.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › Teamscode Spring 2023 Contest ›

CF 104287R - Bingo

Each test gives us a collection of $5 times 5$ bingo boards, one per player. Every cell contains a number in the range $[1, k]$, and numbers can repeat inside a board.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › Teamscode Spring 2023 Contest ›

CF 104287P - In Another World With My Range Query Problems

We are maintaining an array that changes over time, and we must answer two kinds of operations efficiently. The first operation asks for a special aggregate over a subarray.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › Teamscode Spring 2023 Contest ›

CF 104287O - Prefix queries

We maintain a long array of integers that changes over time. Each operation adds a value to every element inside a contiguous segment, and these changes persist permanently.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › Teamscode Spring 2023 Contest ›

CF 104287N - The Tree Problem Is Done For

We are given a weighted tree, meaning there are $N$ nodes connected by $N-1$ edges with no cycles, and each edge has a non-negative weight. From this tree we must select two paths such that they do not share any node.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › Teamscode Spring 2023 Contest ›

CF 104287L - Stuck on Bricks

We are given a geometric construction that behaves like an infinite tiling of identical 1 by 2 rectangles. Each horizontal row is the same pattern as the previous row, but shifted one unit to the right, which creates a staggered brick layout.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › Teamscode Spring 2023 Contest ›

CF 104287M - Magic labyrinth

We are given a directed graph with up to 100 vertices. Each vertex has a value that represents how much gas the explorer inhales if he is at that vertex during a second. The process evolves over time for exactly $k$ seconds. Initially the explorer starts at vertex 1.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › Teamscode Spring 2023 Contest ›

CF 104287K - That Time I Got Reincarnated As A String Problem

We are given a string that contains lowercase letters and wildcard characters. Each wildcard can be replaced independently by any lowercase letter.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › Teamscode Spring 2023 Contest ›

CF 104287J - Two and Three

We are given several independent test cases. In each test case there is an array of positive integers. Two players alternate turns, starting with Nino.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › Teamscode Spring 2023 Contest ›

CF 104287G - Daggers

We are simulating a one-dimensional movement from coordinate 0 to coordinate $n$, where moving costs exactly one second per unit distance and the speed is fixed.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › Teamscode Spring 2023 Contest ›

CF 104287I - Mountain Climbing Hard

We are given a sequence of elevations along a linear mountain path. Each index represents a position, and each value represents its altitude.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › Teamscode Spring 2023 Contest ›

CF 104287H - A Certain Scientific Tree Problem

We are working with a complete binary tree of height $d$. The tree is labeled in the standard heap-style way: node $1$ is the root, and every node $u$ has children $2u$ and $2u+1$ as long as they exist.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › Teamscode Spring 2023 Contest ›

CF 104287E - Cyclic Shifts

We are given two arrays of equal length, and we are allowed to modify the first array until it becomes identical to the second one. The cost model has two parts.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › Teamscode Spring 2023 Contest ›

CF 104287F - Greatest Common Mutiple

Each test gives three integers. Think of the first two numbers as defining a rule for which integers are “valid”: a number is valid only if it is divisible by both of them. The third number acts like a modulus cap that we care about only through remainders.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › Teamscode Spring 2023 Contest ›

CF 104287D - Multiplication Table

We are given an $N times N$ multiplication table where each cell $(i, j)$ contains the product $i cdot j$. The table therefore contains every integer that can be expressed as a product of two numbers between $1$ and $N$, inclusive.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › Teamscode Spring 2023 Contest ›

CF 104287B - Mountain Climbing Easy

We are given a sequence of altitudes along a path, and we walk through it from left to right. The task is to count how many “mountain climbs” appear in this sequence.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › Teamscode Spring 2023 Contest ›

CF 104287A - Are you busy?

The problem is not really about computation in the usual competitive programming sense. The input gives a single integer, called a testcase number, but that value does not affect the answer.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › Teamscode Spring 2023 Contest ›

CF 104287C - No Sweep

We are looking at a sequence of $n$ independent rounds of a game. In each round exactly one player wins. One special player is Thomas, and there are $k$ other competitors, so every round has $k+1$ possible winners.
codeforces competitive-programming Jul 1, 2026