UBC Programming Contest 2019 (UBCPC 2019)

8 problems from UBC Programming Contest 2019 (UBCPC 2019) (contest 102365), difficulty -. 8/8 solutions verified against sample I/O.

8 items

UBC Programming Contest 2019 (UBCPC 2019)

Special | 8 problems | 8/8 verified | Difficulty - | 21m 19s

#	Problem	Time	✓
A	Abnormal Words	1m 18s	✓
B	Balanced Fighters	1m 32s	✓
C	Unjob Search	2m 21s	✓
D	Astrodirections	5m 59s	✓
E	Exciting Acts	3m 3s	✓
F	Fair Distribution	3m 36s	✓
G	Infinity Plus One	2m 5s	✓
H	Ancient Wisdom	1m 25s	✓

Practice › Codeforces Solutions › UBC Programming Contest 2019 (UBCPC 2019) ›

CF 102365A - Abnormal Words

We need to transform a lowercase word using a Caesar cipher. The input first tells us whether to encode or decode. Encoding moves every letter forward by a fixed shift s, while decoding moves every letter backward by the same amount.

Practice › Codeforces Solutions › UBC Programming Contest 2019 (UBCPC 2019) ›

CF 102365C - Unjob Search

We have a tree with (N) cities. A terminal city is simply a leaf, a vertex whose degree is exactly one. The tree itself is hidden from us. We cannot inspect its edges directly.

Practice › Codeforces Solutions › UBC Programming Contest 2019 (UBCPC 2019) ›

CF 102365F - Fair Distribution

For every subset of villagers, consider the area of the convex hull of their houses. A random permutation gives each villager a marginal contribution: when that villager is inserted, compare the new convex hull area with the area before insertion.

Practice › Codeforces Solutions › UBC Programming Contest 2019 (UBCPC 2019) ›

CF 102365G - Infinity Plus One

A counting program describes how far we move through a fixed well-ordered universe. The empty program changes nothing, + takes the next unused element, concatenation runs two programs one after another, and [P] repeats P infinitely many times.

Practice › Codeforces Solutions › UBC Programming Contest 2019 (UBCPC 2019) ›

CF 102365H - Ancient Wisdom

Let David's age be (d), Aram's age be (a), and let the given integer be (C). The conversation tells us that cubing David's age and multiplying by (C) produces exactly Aram's age squared: [ C d^3 = a^2. ] Both ages are positive integers.

Practice › Codeforces Solutions › UBC Programming Contest 2019 (UBCPC 2019) ›

CF 102365E - Exciting Acts

We have an array a[1..N] describing the excitement of the scenes in chronological order. We must cut this array into exactly K non-empty contiguous parts.

Practice › Codeforces Solutions › UBC Programming Contest 2019 (UBCPC 2019) ›

CF 102365D - Astrodirections

We have planets numbered from 1 to (N), and the festival is on exactly one of them. Astrodavid starts at planet 1. A jump by (d0) planets costs (fd), while a jump by (d<0) planets costs (fd), where the input gives these costs for every displacement up to (J).

Practice › Codeforces Solutions › UBC Programming Contest 2019 (UBCPC 2019) ›

CF 102365B - Balanced Fighters

We have up to 100 fighters. Each fighter is described by a name and three statistics: health, attack, and defence. When two fighters meet, every round deals fixed damage to both sides.