2020 UTPC Fall Puzzle Contest

8 problems from 2020 UTPC Fall Puzzle Contest (contest 102868), difficulty -. 4/8 solutions verified against sample I/O.

8 items

2020 UTPC Fall Puzzle Contest

Special | 8 problems | 4/8 verified | Difficulty - | 5m 1s

#	Problem	Time	✓
A	Black	54s	✓
B	Blue	26s
C	Dark-Green	18s
D	Light-Green	21s
E	Orange	54s	✓
F	Red	21s
G	White	57s	✓
H	Yellow	50s	✓

Practice › Codeforces Solutions › 2020 UTPC Fall Puzzle Contest ›

CF 102868C - Dark-Green

I can't write a correct editorial for this problem because the actual problem statement is missing. The prompt only includes the title, "Codeforces 102868C - Dark-Green", with empty sections for the statement, input, and output.

Practice › Codeforces Solutions › 2020 UTPC Fall Puzzle Contest ›

CF 102868D - Light-Green

I can't write a correct editorial for this problem because the actual problem statement is missing. The prompt only includes: - Problem: Codeforces 102868D - Light-Green - Empty Problem Statement - Empty Input - Empty Output Without the statement, it is impossible to determine…

Practice › Codeforces Solutions › 2020 UTPC Fall Puzzle Contest ›

CF 102868F - Red

I can absolutely write that editorial, but I don't have the actual problem statement for Codeforces 102868F - Red.

Practice › Codeforces Solutions › 2020 UTPC Fall Puzzle Contest ›

CF 102868B - Blue

I don't have enough information to write a correct editorial for this problem because the prompt does not include the actual problem statement.

Practice › Codeforces Solutions › 2020 UTPC Fall Puzzle Contest ›

CF 102868H - Yellow

The problem asks us to stop Yellow from travelling through a grid by closing as few doors as possible. The grid contains walls that are always blocked, hallways that are always open, and doors that can be either open or closed.

Practice › Codeforces Solutions › 2020 UTPC Fall Puzzle Contest ›

CF 102868G - White

The task asks us to answer many range queries. For each interval of possible inputs, we need find the number x inside that interval whose generated id code is largest. The generated code is x phi(x), where phi(x) is obtained by replacing every digit of x with its complement to 9.

Practice › Codeforces Solutions › 2020 UTPC Fall Puzzle Contest ›

CF 102868E - Orange

The task is to move a point on an infinite grid from one lattice point to another. A single move changes exactly one coordinate by one unit, so every move is one of the four cardinal directions. The restriction is that the same direction cannot be used twice consecutively.

Practice › Codeforces Solutions › 2020 UTPC Fall Puzzle Contest ›

CF 102868A - Black

The reactor shows a hidden sequence of button presses. The sequence has length N, uses only the nine buttons A through I, and never presses the same button twice. During several repetitions, some flashes are missed, so each observation is only a subsequence of the real sequence.