The 2019 “Orz Panda” Cup Programming Contest

10 problems from The 2019 “Orz Panda” Cup Programming Contest (contest 102309), difficulty -. 10/10 solutions verified against sample I/O.

10 items

The 2019 “Orz Panda” Cup Programming Contest

Special | 10 problems | 10/10 verified | Difficulty - | 44m 28s

#	Problem	Time	✓
A	APA of Orz Pandas	1m 11s	✓
B	Brute Force of Orz Pandas	1m 17s	✓
C	Cai Xukun and Orz Pandas	11m 3s	✓
D	Director of Orz Pandas	1m 2s	✓
E	Expectation of Orz Pandas	2m 41s	✓
F	Fullerene of Orz Pandas	4m 2s	✓
G	Game of Orz Pandas	13m 9s	✓
H	Horton and Orz Pandas	2m 7s	✓
I	IPv6 Address of Orz Pandas	1m 39s	✓
J	Jobless Orz Panda	6m 17s	✓

Practice › Codeforces Solutions › The 2019 “Orz Panda” Cup Programming Contest ›

CF 102309A - APA of Orz Pandas

We are given ordinary C++ arithmetic expressions whose operands are identifiers made only from English letters. The operators are binary +, -, , /, and %, and parentheses may change the evaluation order.

Practice › Codeforces Solutions › The 2019 “Orz Panda” Cup Programming Contest ›

CF 102309D - Director of Orz Pandas

We have two groups of features. The first group contains (n) features and the second contains (m) features. Every feature has a positive weight, and some pairs are declared incompatible.

Practice › Codeforces Solutions › The 2019 “Orz Panda” Cup Programming Contest ›

CF 102309I - IPv6 Address of Orz Pandas

Each test case gives one non-negative integer representing a complete 128-bit IPv6 address. An IPv6 address has exactly eight 16-bit sections, so the first job is to write the integer as exactly 32 hexadecimal digits and split those digits into eight groups of four.

Practice › Codeforces Solutions › The 2019 “Orz Panda” Cup Programming Contest ›

CF 102309H - Horton and Orz Pandas

We have an undirected graph whose vertices are the Orz Pandas and whose edges are possible data links. Every edge has two positive values, a and b. For a chosen set of edges S, the communication requirement says that the chosen edges must form a connected spanning subgraph.

Practice › Codeforces Solutions › The 2019 “Orz Panda” Cup Programming Contest ›

CF 102309E - Expectation of Orz Pandas

There are (n) boxes arranged from left to right. A type 1 operation chooses an interval ([l,r]), a digit (x), and an offset (c). For every position (p) in that interval, where (p=l+k-1), exactly one new paper strip is placed into box (p).

Practice › Codeforces Solutions › The 2019 “Orz Panda” Cup Programming Contest ›

CF 102309B - Brute Force of Orz Pandas

The program generates the standard recursive solution to the Tower of Hanoi problem. For a tower of n disks, it first moves the top n-1 disks from the source peg to the auxiliary peg, then moves disk n from the source to the destination, and finally moves the n-1 disks from…

Practice › Codeforces Solutions › The 2019 “Orz Panda” Cup Programming Contest ›

CF 102309J - Jobless Orz Panda

We are given an (ntimes n) integer matrix (A) and positive integers (b1,ldots,bn). For a vector (x), define (y=Ax). The integral asks for the (n)-dimensional volume of all vectors (x) whose image (y) lies inside the axis-aligned box [ 0le yile bi.

Practice › Codeforces Solutions › The 2019 “Orz Panda” Cup Programming Contest ›

CF 102309G - Game of Orz Pandas

We have n rooms arranged from left to right. Each room contains piles of stones, and a grouped input record (p, q, c) means that room q contains c distinct piles whose size is p. A query gives an interval [l, r].

Practice › Codeforces Solutions › The 2019 “Orz Panda” Cup Programming Contest ›

CF 102309F - Fullerene of Orz Pandas

We have a fixed C60 fullerene, whose 60 carbon atoms are the vertices of a truncated icosahedron, the familiar soccer-ball polyhedron. Each vertex may either remain unchanged or receive one of n atom types.

Practice › Codeforces Solutions › The 2019 “Orz Panda” Cup Programming Contest ›

CF 102309C - Cai Xukun and Orz Pandas

We need to choose an initial velocity for a basketball thrown from (P=(x0,y0)) so that it reaches (Q=(x1,y1)) at some time (t), while the initial speed does not exceed (v{max}). The official problem uses the physical equation [ B(t)=P+v0t+frac12gt^2, ] where (g=(0,-9.80665)).