The 4th Turing Cup

7 problems from The 4th Turing Cup (contest 103698), difficulty -. 7/7 solutions verified against sample I/O.

7 items

The 4th Turing Cup

Special | 7 problems | 7/7 verified | Difficulty - | 6m 24s

#	Problem	Time	✓
B	Majhong	52s	✓
C	The 80/20 Rule	49s	✓
D	Matrix	55s	✓
E	Sequence	56s	✓
F	Tree	1m 6s	✓
G	Palinomial	1m 2s	✓
H	Virus Experiment	44s	✓

Practice › Codeforces Solutions › The 4th Turing Cup ›

CF 103698E - Sequence

We are given a system that builds a sequence step by step starting from a fixed first value. At each next position, the value is determined by one of two deterministic transformations applied to the previous element: either we increase it by a fixed constant or we replace it…

Practice › Codeforces Solutions › The 4th Turing Cup ›

CF 103698D - Matrix

We are given a grid of size $n times m$. Each cell of the grid is either 0 or 1. The grid is not arbitrary: it must satisfy a global consistency rule that ties each cell to the parity structure of its row and column.

Practice › Codeforces Solutions › The 4th Turing Cup ›

CF 103698H - Virus Experiment

We are given a tree with n nodes. Each edge has a label, one of four characters, representing a transformation applied when a “signal” travels through that edge.

Practice › Codeforces Solutions › The 4th Turing Cup ›

CF 103698C - The 80/20 Rule

We are given a collection of bank accounts, each holding some amount of money. The task is not to optimize over subsets in the usual sense, but to understand how “uneven” the distribution can be made when we group people into a prefix of the sorted population versus its…

Practice › Codeforces Solutions › The 4th Turing Cup ›

CF 103698G - Palinomial

We are given $n$ polynomials, each described by its coefficients in increasing degree order. Then we answer $q$ queries, each query giving an interval $[l, r]$.

Practice › Codeforces Solutions › The 4th Turing Cup ›

CF 103698F - Tree

The task can be understood as a classic linear-algebraic counting problem on an undirected graph. Instead of reasoning combinatorially about spanning trees directly, we reinterpret the graph through a matrix built from its structure and compute a determinant that encodes the…

Practice › Codeforces Solutions › The 4th Turing Cup ›

CF 103698B - Majhong

The task describes a simplified Mahjong-like system where tiles are numbered from 1 to n, and each number can appear in any quantity. The entire hand is just a multiset of these numbers. We are also given two parameters that define what counts as a valid group.