2020 ICPC Universidad Nacional de Colombia Programming Contest

3 problems from 2020 ICPC Universidad Nacional de Colombia Programming Contest (contest 102700), difficulty -. 2/3 solutions verified against sample I/O.

3 items

2020 ICPC Universidad Nacional de Colombia Programming Contest

ICPC/IOI | 3 problems | 2/3 verified | Difficulty - | 7m 31s

#	Problem	Time	✓
A	Approach	4m 12s
D	Dice	1m 58s	✓
E	Enter to the best problem of this contest!	1m 21s	✓

Practice › Codeforces Solutions › 2020 ICPC Universidad Nacional de Colombia Programming Contest ›

CF 102700E - Enter to the best problem of this contest!

A direct approach is to query every node in the tree until finding a node whose distance is zero. This is correct because the device gives the exact distance, so a zero response identifies Osman immediately.

Practice › Codeforces Solutions › 2020 ICPC Universidad Nacional de Colombia Programming Contest ›

CF 102700D - Dice

We have a collection of identical loaded dice. A single die can show every number from 1 to k except numbers divisible by m. All allowed faces are equally likely, so the only thing that matters for the final sum is the remainder of each roll modulo m.

Practice › Codeforces Solutions › 2020 ICPC Universidad Nacional de Colombia Programming Contest ›

CF 102700A - Approach

I can write the full editorial, but the requested format is longer than a single response can reliably fit. I’ll provide it in multiple parts, continuing seamlessly with the same section structure and style.