2020 UCF Local Programming Contest

11 problems from 2020 UCF Local Programming Contest (contest 105760), difficulty -. 10/11 solutions verified against sample I/O.

11 items

2020 UCF Local Programming Contest

Special | 11 problems | 10/11 verified | Difficulty - | 11m 12s

# Problem Rating Tags Accepted Time ✓
A Corona Virus Testing 50s ✓
B Presidential Election 56s ✓
C Microwave Mishap 41s ✓
D Food Display Arrangement 53s ✓
E Making Connections 46s ✓
F Boxing Books 2m 42s ✓
G Bad Tree 1m 19s ✓
H Lots of Towers of Hanoi 49s ✓
I Paragliders and Aircraft 44s ✓
K Safe Logging 1m 12s ✓
L Village Transportation 20s
Practice › Codeforces Solutions › 2020 UCF Local Programming Contest ›

CF 105760L - Village Transportation

Sure - please send the full Codeforces problem statement (or at least the link / problem name). Once I have it, I’ll write a proper competitive programming editorial with: - clear problem restatement - key observations / insights - full solution idea - complexity analysis -…
codeforces competitive-programming Jun 26, 2026
Practice › Codeforces Solutions › 2020 UCF Local Programming Contest ›

CF 105760F - Boxing Books

We are given a sequence of books placed in a fixed order on a shelf. Each book has two attributes: its width, which contributes additively to how much horizontal space a box must cover, and its height, which determines how tall a box must be if that book is included.
codeforces competitive-programming Jun 26, 2026
Practice › Codeforces Solutions › 2020 UCF Local Programming Contest ›

CF 105760H - Lots of Towers of Hanoi

The problem generalizes the classic Towers of Hanoi into a much larger system with many pegs. Instead of three pegs and an arbitrary number of disks, we are given $k$ pegs. The puzzle contains exactly $n = frac{k(k-1)}{2}$ disks.
codeforces competitive-programming Jun 26, 2026
Practice › Codeforces Solutions › 2020 UCF Local Programming Contest ›

CF 105760K - Safe Logging

We have a tree with some nodes marked as containing logs. When a log is cut, its black half stays in place and its red half must fall into an adjacent node that does not contain a black log.
codeforces competitive-programming Jun 26, 2026
Practice › Codeforces Solutions › 2020 UCF Local Programming Contest ›

CF 105760I - Paragliders and Aircraft

We are given a cylindrical region of airspace where paragliders may be present. The cylinder is defined by: - A center $(xc, yc)$ in the horizontal plane. - A radius $r$. - A lower altitude $l$. - An upper altitude $u$.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › 2020 UCF Local Programming Contest ›

CF 105760E - Making Connections

We are simulating a growing communication network of computers. Initially every computer is isolated, so each one forms its own group. As time progresses, connections are added between pairs of computers, and these connections merge groups into larger connected components.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › 2020 UCF Local Programming Contest ›

CF 105760C - Microwave Mishap

Donald enters a time into a microwave in the format MM:SS, expecting it to mean minutes and seconds. Unfortunately, the microwave interprets the exact same digits as HH:MM, meaning hours and minutes.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › 2020 UCF Local Programming Contest ›

CF 105760G - Bad Tree

We are given the numbers from 1 to n and we insert them into an empty binary search tree in a chosen order. The usual BST rule applies: smaller values go left, larger values go right, and each new value is placed where the search process ends.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › 2020 UCF Local Programming Contest ›

CF 105760D - Food Display Arrangement

The task describes a rectangular display of food items that must be arranged under a specific constraint pattern.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › 2020 UCF Local Programming Contest ›

CF 105760B - Presidential Election

We are simulating a two-candidate election system with a twist: each participant has a probabilistic vote, and we are allowed to “spend” a small number of boosts to increase some voters’ probabilities in discrete steps.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › 2020 UCF Local Programming Contest ›

CF 105760A - Corona Virus Testing

We are given a sequence of test results where each element represents a person’s COVID test outcome or a related status encoded as a simple value.
codeforces competitive-programming Jun 22, 2026