The Hangzhou Normal U Qualification Trials for ZJPSC 2020

13 problems from The Hangzhou Normal U Qualification Trials for ZJPSC 2020 (contest 103463), difficulty -. 13/13 solutions verified against sample I/O.

13 items

The Hangzhou Normal U Qualification Trials for ZJPSC 2020

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

# Problem Rating Tags Accepted Time ✓
A A simple problem 54s ✓
B Hsueh- play balls 44s ✓
C Hoogle Machine Translation 55s ✓
D Dup4 and pebble pile 46s ✓
E The King Of Sum Xor 52s ✓
F Hsueh- Love Matrix 48s ✓
G LTS owns large quantities of apples 59s ✓
H Hsueh- and keyboard 1m 7s ✓
I LTS and rectangular area union 59s ✓
J Hsueh- owns large quantities of apples 43s ✓
K LTS buy wine 41s ✓
L Line problem 47s ✓
M Rikka with Random Graph 56s ✓
Practice › Codeforces Solutions › The Hangzhou Normal U Qualification Trials for ZJPSC 2020 ›

CF 103463M - Rikka with Random Graph

We are given a directed graph on up to one hundred thousand vertices, but the edges are not explicitly listed in the input. Instead, the graph is generated internally using a deterministic pseudo-random generator seeded by two integers.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The Hangzhou Normal U Qualification Trials for ZJPSC 2020 ›

CF 103463K - LTS buy wine

A row of wine bottles is placed from left to right, each bottle having a fixed intrinsic value. Every day exactly one bottle is removed from either the left end or the right end of the current row.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The Hangzhou Normal U Qualification Trials for ZJPSC 2020 ›

CF 103463L - Line problem

We are given two line segments in the plane for each test case. Each segment is defined by two endpoints with integer coordinates. The task is to compute how much of these two segments overlaps along their geometry, but only when the overlap forms a segment of positive length.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The Hangzhou Normal U Qualification Trials for ZJPSC 2020 ›

CF 103463J - Hsueh- owns large quantities of apples

We are modeling a deterministic transfer process that starts with a single pile of apples and moves through a line of m children. The first child receives all n apples.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The Hangzhou Normal U Qualification Trials for ZJPSC 2020 ›

CF 103463H - Hsueh- and keyboard

We are given an initial text buffer whose only relevant property is its length, call it x. From this starting state, we want to transform the buffer so that its length becomes exactly n using a set of keyboard operations.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The Hangzhou Normal U Qualification Trials for ZJPSC 2020 ›

CF 103463I - LTS and rectangular area union

We are given a sequence of axis-aligned rectangles that all sit on the x-axis, meaning every rectangle has its bottom edge on $y = 0$. Each rectangle $i$ spans an interval $[Li, Ri]$ on the x-axis and has height $Hi$.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The Hangzhou Normal U Qualification Trials for ZJPSC 2020 ›

CF 103463G - LTS owns large quantities of apples

We are simulating a deterministic transfer process of apples across a line of $m$ children. The process starts with an initial number $n$, which is given to the first child.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The Hangzhou Normal U Qualification Trials for ZJPSC 2020 ›

CF 103463F - Hsueh- Love Matrix

We are given a rectangular grid with $n$ rows and $m$ columns. Each cell $(i, j)$ contains the value $i cdot j$. So row 1 is $1, 2, dots, m$, row 2 is $2, 4, dots, 2m$, and so on.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The Hangzhou Normal U Qualification Trials for ZJPSC 2020 ›

CF 103463E - The King Of Sum Xor

We are given two 64-bit non-negative integers, a target sum $S$ and a target xor value $X$. We are allowed to construct an array of non-negative integers, possibly empty, such that the sum of its elements equals $S$ and the bitwise xor of its elements equals $X$.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The Hangzhou Normal U Qualification Trials for ZJPSC 2020 ›

CF 103463C - Hoogle Machine Translation

We are given a collection of words, and we must produce their corresponding translations in the same order. The only way to obtain translations is through an interactive machine. The machine behaves in two consistent ways. If we query a single word, it returns its translation.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The Hangzhou Normal U Qualification Trials for ZJPSC 2020 ›

CF 103463D - Dup4 and pebble pile

We are given a contiguous range of integers from $a$ to $b$, and initially each number stands alone as its own pile. We are allowed to merge two piles if we can find a number in each pile that shares a prime factor $t$ with $t ge p$.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The Hangzhou Normal U Qualification Trials for ZJPSC 2020 ›

CF 103463A - A simple problem

We are given a set of digits from 0 to n, and we are asked to consider all possible permutations of these digits. Each permutation is interpreted as a number by concatenating the digits in order.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The Hangzhou Normal U Qualification Trials for ZJPSC 2020 ›

CF 103463B - Hsueh- play balls

We have a box initially containing two types of indistinguishable balls, n white and m black. We repeatedly remove one ball uniformly at random until the box becomes empty.
codeforces competitive-programming Jul 3, 2026