UTPC Contest 01-26-24 Div. 2 (Beginner)

8 problems from UTPC Contest 01-26-24 Div. 2 (Beginner) (contest 104930), difficulty -. 3/8 solutions verified against sample I/O.

8 items

UTPC Contest 01-26-24 Div. 2 (Beginner)

Div. 2 | 8 problems | 3/8 verified | Difficulty - | 14m 49s

#	Problem	Time	✓
A	Up Up Down Down	58s	✓
B	Upside Downtown	58s	✓
C	Gambler's Chocolate Cove	4m 13s
D	The World Turned Upside Down	1m 12s
E	Up Down Matching	1m 4s
F	Down Up Disco	1m 20s
G	Dinnerbone and Array	4m 12s
H	Australian Solitaire	52s	✓

Practice › Codeforces Solutions › UTPC Contest 01-26-24 Div. 2 (Beginner) ›

CF 104930A - Up Up Down Down

We are given a fixed sequence of 11 words, each representing a button press in a game cheat code. Separately, there is a known reference sequence, the Konami Code, which is also 11 inputs long.

Practice › Codeforces Solutions › UTPC Contest 01-26-24 Div. 2 (Beginner) ›

CF 104930G - Dinnerbone and Array

We are given a small array of integers, each test case independent. From that array, we consider every possible subset of elements except that we are not allowed to take the entire array.

Practice › Codeforces Solutions › UTPC Contest 01-26-24 Div. 2 (Beginner) ›

CF 104930H - Australian Solitaire

We are asked to count sequences of length $N$ where each position contains a “rank” chosen from a fixed ordered set of 13 denominations: Ace is the smallest, followed by 2 up to King.

Practice › Codeforces Solutions › UTPC Contest 01-26-24 Div. 2 (Beginner) ›

CF 104930F - Down Up Disco

We are given an $N times M$ grid where each cell contains a binary value. A value of 1 means the tile is currently flipped, and 0 means it is already correct.

Practice › Codeforces Solutions › UTPC Contest 01-26-24 Div. 2 (Beginner) ›

CF 104930C - Gambler's Chocolate Cove

Each slot machine behaves like a stochastic reward generator. When you pull a machine once, it returns one value from a fixed finite set, each value having a known probability. Those probabilities do not change over time and every pull is independent of previous pulls.

Practice › Codeforces Solutions › UTPC Contest 01-26-24 Div. 2 (Beginner) ›

CF 104930E - Up Down Matching

We are given several independent test cases. In each test case, a line of people stands in a fixed order, where each person is either from Uptown or Downside.

Practice › Codeforces Solutions › UTPC Contest 01-26-24 Div. 2 (Beginner) ›

CF 104930D - The World Turned Upside Down

We are given a starting point that is always the number 1, and we are allowed to build a sequence by repeatedly multiplying the current value by any positive integer.

Practice › Codeforces Solutions › UTPC Contest 01-26-24 Div. 2 (Beginner) ›

CF 104930B - Upside Downtown

We are given a house number written as a string of digits. The city has a symmetry rule: when you rotate the number by 180 degrees, it must still form a valid readable number using the same digit system. Only a restricted set of digits survives rotation: 0, 1, 6, 8, and 9.