2021 UCF Local Programming Contest

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

11 items

2021 UCF Local Programming Contest

Special | 11 problems | 11/11 verified | Difficulty - | 9m 37s

#	Problem	Time	✓
A	Odd/Even Strings	52s	✓
B	Fiborooji Sequence	53s	✓
C	Soccer Standing Table	43s	✓
D	Caterpillar Walk	49s	✓
E	Tutorial Groupings	55s	✓
F	Food Poisoning	1m 2s	✓
G	Toboggan Ride	48s	✓
H	Discord Daisy Chain	49s	✓
I	K-gap Subsequence	50s	✓
J	Ultimate Commitment Forever	55s	✓
K	Really Nerdy Game	1m 1s	✓

Practice › Codeforces Solutions › 2021 UCF Local Programming Contest ›

CF 105761C - Soccer Standing Table

We are given five integers that describe a soccer team’s season statistics, but the order of these integers is scrambled. We know they correspond to matches played, wins, draws, losses, and total points, but we do not know which number is which.

Practice › Codeforces Solutions › 2021 UCF Local Programming Contest ›

CF 105761A - Odd/Even Strings

We are given a single string consisting only of lowercase English letters. The task is to classify this string based on how many times each distinct letter appears. A string is called odd if every character that appears in it occurs an odd number of times.

Practice › Codeforces Solutions › 2021 UCF Local Programming Contest ›

CF 105761K - Really Nerdy Game

We are given a circular board with positions labeled from 1 to n. A token starts at position 1. Each move consists of rolling a fair die with faces from 1 to d, and moving forward that many steps along the circle. If we go past n, we wrap back to 1. Some positions are special.

Practice › Codeforces Solutions › 2021 UCF Local Programming Contest ›

CF 105761J - Ultimate Commitment Forever

We are working on a very large integer grid where each point has four-neighbor movement, up, down, left, and right. Some grid points are blocked because construction is happening there, and these blocked points cannot be visited.

Practice › Codeforces Solutions › 2021 UCF Local Programming Contest ›

CF 105761I - K-gap Subsequence

We are given a sequence of integers and a threshold value k. From the sequence, we want to pick a subsequence, meaning we keep some elements without changing their order, and we try to make it as long as possible.

Practice › Codeforces Solutions › 2021 UCF Local Programming Contest ›

CF 105761H - Discord Daisy Chain

We can model the system as a directed graph where each channel is a node. Each bot acts like a small forwarding rule: it listens on exactly one source channel, and when that channel receives a message, the bot forwards the message to a fixed list of destination channels.

Practice › Codeforces Solutions › 2021 UCF Local Programming Contest ›

CF 105761G - Toboggan Ride

We are given a straight path from position 0 to position L. Along this line there are special points called boost stations.

Practice › Codeforces Solutions › 2021 UCF Local Programming Contest ›

CF 105761F - Food Poisoning

We are trying to identify one unknown “bad” restaurant among n candidates. Each week we are allowed to choose any subset of restaurants and observe a binary outcome: if the bad restaurant is inside the chosen subset, Mikey gets sick that week, otherwise he does not.

Practice › Codeforces Solutions › 2021 UCF Local Programming Contest ›

CF 105761E - Tutorial Groupings

We are given a list of students, each with a distinct knowledge level. The goal is to partition them into contiguous groups after sorting by knowledge level, so that each group satisfies two constraints: the range inside the group, defined as maximum minus minimum knowledge…

Practice › Codeforces Solutions › 2021 UCF Local Programming Contest ›

CF 105761D - Caterpillar Walk

We are given a skyline-like city made of axis-aligned rectangular buildings placed on top of the x-axis. Each building starts at some x-coordinate, extends to the right for a fixed width, and rises vertically to a given height.

Practice › Codeforces Solutions › 2021 UCF Local Programming Contest ›

CF 105761B - Fiborooji Sequence

We are given a starting pair of single-digit numbers, where at least one is non-zero. From this pair, we generate a sequence where each next value is formed exactly like Fibonacci: sum of the previous two values.