UCF Locals 2015

10 problems from UCF Locals 2015 (contest 102297), difficulty -. 10/10 solutions verified against sample I/O.

10 items

UCF Locals 2015

Special | 10 problems | 10/10 verified | Difficulty - | 42m 15s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Find the Twins				2m 15s	✓
B	Medal Ranking				58s	✓
C	Brownies vs. Candies vs. Cookies				1m 33s	✓
D	Lemonade Stand				2m 33s	✓
E	Rain Gauge				1m 8s	✓
F	Balanced Strings				10m 13s	✓
G	Towers of Hanoi Grid				17m 51s	✓
H	Reach for the Stars				1m 52s	✓
J	You Shall Pass				1m 57s	✓
K	Turing's Challenge				1m 55s	✓

Practice › Codeforces Solutions › UCF Locals 2015 ›

CF 102297C - Brownies vs. Candies vs. Cookies

Each practice starts with a fixed number of brownies and a known number of students. Students arrive at the refreshment table in groups. Every student in a group takes exactly one brownie, but before that happens Dr.

Practice › Codeforces Solutions › UCF Locals 2015 ›

CF 102297G - Towers of Hanoi Grid

We have an (n times n) directed grid. A disk can move only one cell down or one cell right, so every disk follows a monotone path from the upper-left corner to the lower-right corner.

Practice › Codeforces Solutions › UCF Locals 2015 ›

CF 102297H - Reach for the Stars

The stamp is a fixed axis-aligned cross consisting of five cells: the center cell and its four orthogonally adjacent cells. A stamping turns those five paper cells black.

Practice › Codeforces Solutions › UCF Locals 2015 ›

CF 102297B - Medal Ranking

Each test case describes the medal counts of two countries, USA and Russia. The six integers are ordered as USA gold, silver, bronze, followed by Russia gold, silver, bronze. There are two independent ways to decide whether USA wins.

Practice › Codeforces Solutions › UCF Locals 2015 ›

CF 102297K - Turing's Challenge

For each query, we are given positive integers (X) and (N). Consider the (N+1) terms of the binomial expansion [ (1+X)^N, ] where the term with index (i), using one-based indexing, is [ Ti=binom{N}{i-1}X^{i-1}. ] We may choose any subset of these indices.

Practice › Codeforces Solutions › UCF Locals 2015 ›

CF 102297J - You Shall Pass

We have up to 50 students, and every student must be assigned to either Matt's class or Sean's class. Student (i) has a base probability of passing Matt's class and another base probability of passing Sean's class.

Practice › Codeforces Solutions › UCF Locals 2015 ›

CF 102297F - Balanced Strings

We classify every lowercase letter as either a vowel or a consonant. The vowels are a, e, i, o, u, and y, so there are 6 possible vowels and 20 possible consonants. Every ? in the input may be replaced independently by any of the 26 lowercase letters.

Practice › Codeforces Solutions › UCF Locals 2015 ›

CF 102297E - Rain Gauge

We need the area common to two centered shapes: a square with side length s and a circle with radius r. Since their centers coincide, the answer depends only on how the circle reaches the four sides and corners of the square.

Practice › Codeforces Solutions › UCF Locals 2015 ›

CF 102297D - Lemonade Stand

We have a sequence of selling days. On day (i), exactly (ci) cups are requested. Every cup consumes (x) lemons and (s) ounces of sugar. Lemons can be purchased individually, while sugar is sold only in five-pound bags.

Practice › Codeforces Solutions › UCF Locals 2015 ›

CF 102297A - Find the Twins

Each test case describes the jersey numbers of exactly 10 soccer players. Mack always wears number 18, while Zack always wears number 17. For every set of 10 numbers, we must determine whether the set contains Mack, Zack, both, or neither.