ICPC Central Russia Regional Contest (CRRC 19)

11 problems from ICPC Central Russia Regional Contest (CRRC 19) (contest 102780), difficulty -. 10/11 solutions verified against sample I/O.

11 items

ICPC Central Russia Regional Contest (CRRC 19)

ICPC/IOI | 11 problems | 10/11 verified | Difficulty - | 16m 37s

#	Problem	Time	✓
A	Green tea	1m 46s	✓
B	Mysterious Resistors	1m 9s	✓
C	Emoticons	1m 1s	✓
D	Power play	1m 11s	✓
E	Printed circuit board	1m 33s	✓
F	A word game	1m 35s	✓
G	Hourglass	2m 16s	✓
H	Men's showdown	1m	✓
I	Andrew and Python	1m 6s	✓
J	Something that resembles Waring's problem	2m 1s	✓
K	Parabolic sorting	1m 59s

Practice › Codeforces Solutions › ICPC Central Russia Regional Contest (CRRC 19) ›

CF 102780C - Emoticons

The input is a scrambled collection of characters that originally came from writing several emoticons one after another. The order of characters was lost, but the total number of occurrences of every character was preserved.

Practice › Codeforces Solutions › ICPC Central Russia Regional Contest (CRRC 19) ›

CF 102780J - Something that resembles Waring's problem

We need write a given positive integer as a sum of at most five integer cubes. The input number can be extremely large, up to $10^{100000}$, so it cannot fit into normal integer types.

Practice › Codeforces Solutions › ICPC Central Russia Regional Contest (CRRC 19) ›

CF 102780K - Parabolic sorting

I’m not able to provide a reliable full editorial and implementation for this problem right now because I have not derived a verified O(n log n) solution. I don’t want to invent an algorithm or code that looks plausible but fails on hidden cases.

Practice › Codeforces Solutions › ICPC Central Russia Regional Contest (CRRC 19) ›

CF 102780A - Green tea

I will provide the editorial as a complete standalone document. Edit The task is to choose how many spoonfuls of hot water and cold water to put into a mug so that the resulting mixture has a temperature of exactly 80 degrees.

Practice › Codeforces Solutions › ICPC Central Russia Regional Contest (CRRC 19) ›

CF 102780I - Andrew and Python

I will provide the editorial as a reusable document. The problem is interactive, so the testing section describes how to validate the query logic rather than pretending the interactive judge can be reproduced offline.

Practice › Codeforces Solutions › ICPC Central Russia Regional Contest (CRRC 19) ›

CF 102780H - Men's showdown

We have a pile containing N crayons. Two players alternate turns, and on each turn a player removes exactly 1, 5, or 13 crayons. The player who takes the last remaining crayon wins immediately.

Practice › Codeforces Solutions › ICPC Central Russia Regional Contest (CRRC 19) ›

CF 102780G - Hourglass

I’ll provide the editorial as a standalone document. Edit We have at most four hourglasses. Each hourglass measures one fixed duration, and its sand can be running in either direction. We are allowed to flip hourglasses only at moments when at least one hourglass becomes empty.

Practice › Codeforces Solutions › ICPC Central Russia Regional Contest (CRRC 19) ›

CF 102780F - A word game

The game is played on a word, but the order of letters is not the part that matters. A move only cares about how many copies of each letter remain.

Practice › Codeforces Solutions › ICPC Central Russia Regional Contest (CRRC 19) ›

CF 102780E - Printed circuit board

The board is a drawing of wires placed on a rectangular grid. Each non-empty tile describes which sides of that tile contain wire segments.

Practice › Codeforces Solutions › ICPC Central Russia Regional Contest (CRRC 19) ›

CF 102780D - Power play

We need find the smallest positive integer x such that the power of a with exponent x is equal to the power of x with exponent b. The two input values are the bases involved in this equation, and the answer is the smallest valid x not exceeding 10^18.

Practice › Codeforces Solutions › ICPC Central Russia Regional Contest (CRRC 19) ›

CF 102780B - Mysterious Resistors

The circuit is built from several identical unknown resistors. Each stage contains one known resistor and one mysterious resistor connected in parallel, and all stages are then connected in series.