TeamsCode Summer 2022 Contest

18 problems from TeamsCode Summer 2022 Contest (contest 103870), difficulty -. 15/18 solutions verified against sample I/O.

18 items

TeamsCode Summer 2022 Contest

Special | 18 problems | 15/18 verified | Difficulty - | 14m 22s

# Problem Rating Tags Accepted Time ✓
A Best Waifu 39s ✓
B Sanity 37s ✓
C Calendar 44s ✓
D Penalty 44s ✓
E Mixed Economy 44s ✓
F Cloning 44s ✓
G XOR Fun 28s
H Zero Trust 46s ✓
I Counting Flags 2m 6s
J Thomas Game Revisited Again 44s ✓
K Rock Paper Scissors (Easy Version) 45s ✓
L Quantum Schmovements 45s ✓
M Driving 47s ✓
N Schemy 48s ✓
O Highways 50s ✓
P Waku-Waku Abyss 52s ✓
Q Food Poisoning 31s
R Rock Paper Scissors (Hard Version) 48s ✓
Practice › Codeforces Solutions › TeamsCode Summer 2022 Contest ›

CF 103870R - Rock Paper Scissors (Hard Version)

The problem defines a sequence of values $f1, f2, dots, fn$ that must be computed in increasing order. Each $fi$ depends on a direct contribution term $ci$, a scaling term $bi$, and a history-dependent quantity $ai$.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › TeamsCode Summer 2022 Contest ›

CF 103870P - Waku-Waku Abyss

We are given a sequence of values on cities, and we want to travel from city 1 to city N. Moving from a city i to a later city j has a cost that depends on the bitwise xor of the values between them, specifically the xor of the segment from i+1 to j, followed by a fixed shift…
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › TeamsCode Summer 2022 Contest ›

CF 103870Q - Food Poisoning

Let $H$ be an $m times n$ binary matrix and let $$f(x) = [Hx = 0],$$ where arithmetic is over $mathbb{F}2$. The BDD for $f$ is constructed under a fixed ordering of variables $x1,dots,xn$ as in Section 7.1.4.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › TeamsCode Summer 2022 Contest ›

CF 103870O - Highways

We are given a set of horizontal or slanted “roads” that can be thought of as intervals on the x axis, each equipped with a y coordinate representing its height.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › TeamsCode Summer 2022 Contest ›

CF 103870I - Counting Flags

An $n$-tuple $(a1,dots,an)$ is admissible when it satisfies the alternating constraint $$a1 le a2 ge a3 le a4 ge cdots .$$ Let $mathcal{A}n$ denote the set of all such binary $n$-tuples.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › TeamsCode Summer 2022 Contest ›

CF 103870N - Schemy

We are working on a grid where a fixed “intended path” is already given implicitly, and the task is to place obstacles so that this path becomes the only viable way to traverse under the movement rules.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › TeamsCode Summer 2022 Contest ›

CF 103870M - Driving

We are working with a weighted undirected graph where some vertices are marked as “cool”. The goal is not to compute ordinary shortest paths, but something stronger: for any pair of cool vertices, we consider all possible paths between them and look at the largest edge…
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › TeamsCode Summer 2022 Contest ›

CF 103870L - Quantum Schmovements

We are given a graph with labeled edges, and two entities moving on it simultaneously: Waymo and Thomas. Each state of the system is described by a pair of positions, one for Thomas and one for Waymo.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › TeamsCode Summer 2022 Contest ›

CF 103870K - Rock Paper Scissors (Easy Version)

We are looking at a stochastic elimination process built around repeated rounds of a three-choice game where each participant independently picks one of three options.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › TeamsCode Summer 2022 Contest ›

CF 103870J - Thomas Game Revisited Again

The task revolves around the text that would be produced if we expand a piece of code that represents a matrix-style computation.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › TeamsCode Summer 2022 Contest ›

CF 103870H - Zero Trust

We are given a sequence of students, each associated with a trust value that changes as we process the system. At any moment, some students are considered to have positive trust, and we are interested in two things: how many students currently have positive trust, and the sum…
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › TeamsCode Summer 2022 Contest ›

CF 103870D - Penalty

We are given a rectangular grid of integers with n rows and m columns. Each cell contributes a value, and we can compute the sum over any subrectangle using a function f(a, b, c, d), which means summing all cells in rows a through b and columns c through d.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › TeamsCode Summer 2022 Contest ›

CF 103870G - XOR Fun

I can’t produce a correct editorial for Codeforces 103870G - XOR Fun yet because the actual problem statement is not available from standard archives or mirrors, and it is not identifiable from known Codeforces contests or gym indexes with certainty.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › TeamsCode Summer 2022 Contest ›

CF 103870F - Cloning

We are given a line of positions of some length, together with several constraints, each constraint describing a contiguous segment. The task is to decide whether it is possible to assign two types of symbols across the whole line so that all constraints are satisfied.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › TeamsCode Summer 2022 Contest ›

CF 103870E - Mixed Economy

We are given a sequence that represents spending events over time, where each event is associated with a person identifier. The same person may appear multiple times, forming contiguous segments of activity.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › TeamsCode Summer 2022 Contest ›

CF 103870C - Calendar

We are working with a simplified calendar of a non-leap year, where the year has 365 days and each day can either contain an event or be empty. The input ultimately describes which specific days have events, and everything else is implicitly empty.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › TeamsCode Summer 2022 Contest ›

CF 103870A - Best Waifu

The task is unusually minimal: there is no meaningful structured input to process, and the output is expected to be produced directly based on the problem’s statement rather than any computation over data.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › TeamsCode Summer 2022 Contest ›

CF 103870B - Sanity

We are tracking a simple repeating process over time. Each day contributes to a running counter that measures how many days have passed since the last reset event.
codeforces competitive-programming Jul 2, 2026