UTPC Contest 01-27-23 Div. 2 (Beginner)

9 problems from UTPC Contest 01-27-23 Div. 2 (Beginner) (contest 104157), difficulty -. 6/9 solutions verified against sample I/O.

9 items

UTPC Contest 01-27-23 Div. 2 (Beginner)

Div. 2 | 9 problems | 6/9 verified | Difficulty - | 10m 39s

#	Problem	Time	✓
A	Printing Papers	57s	✓
B	Watch Your Sugar!	44s	✓
C	Flush-tastic Throwing Challenge	1m 14s	✓
D	Speedy Stamping	58s	✓
E	Brainless Brainstorming	1m 8s
F	Toilet Orders	1m 19s
G	Crappy Typing	59s	✓
H	Crapper's Collapse Catastrophe	1m 6s	✓
I	Drunk Coworker	2m 14s

Practice › Codeforces Solutions › UTPC Contest 01-27-23 Div. 2 (Beginner) ›

CF 104157I - Drunk Coworker

A quadratic curve describes how a drunk coworker walks across a rectangular office. At any horizontal position $x$, his position is $f(x)$, so his path is a parabola. He cannot see infinitely precisely.

Practice › Codeforces Solutions › UTPC Contest 01-27-23 Div. 2 (Beginner) ›

CF 104157H - Crapper's Collapse Catastrophe

The building can be seen as a rooted structure where room numbers represent nodes in a very large implicit tree. Room 0 is the root. Every room belongs to a floor, and the structure alternates branching rules depending on whether the floor index is even or odd.

Practice › Codeforces Solutions › UTPC Contest 01-27-23 Div. 2 (Beginner) ›

CF 104157G - Crappy Typing

We are given a sequence of employees standing in a fixed order, where each employee has a known typing duration. There are M identical computers, and these computers act like parallel processors that continuously take the next available person in the queue.

Practice › Codeforces Solutions › UTPC Contest 01-27-23 Div. 2 (Beginner) ›

CF 104157F - Toilet Orders

We are given two large integers per test case, representing available counts of two complementary parts. From these counts, Thomas effectively produces a number of complete pairs equal to the greatest common divisor of the two values.

Practice › Codeforces Solutions › UTPC Contest 01-27-23 Div. 2 (Beginner) ›

CF 104157E - Brainless Brainstorming

We are given a sequence of $N$ time slots. In each slot $i$, there are three employees, and each employee would contribute a known number of ideas if invited during that slot. However, Michael has two restrictions that interact in a nontrivial way.

Practice › Codeforces Solutions › UTPC Contest 01-27-23 Div. 2 (Beginner) ›

CF 104157D - Speedy Stamping

We are given a target string consisting only of the characters T and C. We want to count how many different ways an employee can produce this exact string using a fixed set of stamps.

Practice › Codeforces Solutions › UTPC Contest 01-27-23 Div. 2 (Beginner) ›

CF 104157C - Flush-tastic Throwing Challenge

We are given a circular target on a 2D plane and a list of points representing where different employees threw an object. The task is to count how many of these thrown points land inside the circle or exactly on its boundary. Each throw is just a coordinate pair.

Practice › Codeforces Solutions › UTPC Contest 01-27-23 Div. 2 (Beginner) ›

CF 104157A - Printing Papers

We are given a weekly supply limit, and Michael is allowed to make exactly one purchase. The restriction is that the quantity he buys must be a power of two. Among all valid purchase amounts that do not exceed the available supply, we need to choose the largest one.

Practice › Codeforces Solutions › UTPC Contest 01-27-23 Div. 2 (Beginner) ›

CF 104157B - Watch Your Sugar!

We are given a collection of chocolates, each with a known amount of sugar. Thomas has a daily sugar limit and wants to eat as many whole chocolates as possible without the total sugar exceeding that limit.