mBIT Rookie November 2019

15 problems from mBIT Rookie November 2019 (contest 102617), difficulty -. 6/15 solutions verified against sample I/O.

15 items

mBIT Rookie November 2019

Special | 15 problems | 6/15 verified | Difficulty - | 14m 33s

#	Problem	Time	✓
A	Rating System	1m 11s	✓
B	Candy Bowl	1m
C	Patisserie	42s
D	Sugar Cubes	42s
E	Genotypes	38s
F	Baking Pan	57s	✓
G	Number Cookies	1m 17s
H	Cinnamon Spiral	52s
I	Ice Cream	1m 1s	✓
J	Frosting Patterns	57s
K	Dessert Islands	59s	✓
L	Sugar Sampling	1m 8s
M	Magical Calendar	1m 4s	✓
N	Pie Predicament	1m 8s	✓
O	Candle Lighting	57s

Practice › Codeforces Solutions › mBIT Rookie November 2019 ›

CF 102617B - Candy Bowl

I can write the editorial, but the problem statement for Codeforces 102617B “Candy Bowl” is missing from the prompt. I could not reliably identify the exact problem from the problem ID alone, and inventing the algorithm would risk producing a wrong editorial and solution.

Practice › Codeforces Solutions › mBIT Rookie November 2019 ›

CF 102617O - Candle Lighting

I can write the editorial, but the problem statement section is empty and I cannot determine the actual task for Codeforces 102617O - Candle Lighting from the information provided. I do not want to invent an algorithm, examples, or code for a different “candle” problem.

Practice › Codeforces Solutions › mBIT Rookie November 2019 ›

CF 102617L - Sugar Sampling

I can write the editorial, but the problem statement section is empty and I cannot reliably determine the actual task from only “Codeforces 102617L - Sugar Sampling”. I do not want to invent an algorithm, constraints, samples, or code for the wrong problem.

Practice › Codeforces Solutions › mBIT Rookie November 2019 ›

CF 102617J - Frosting Patterns

I can write the editorial, but the problem statement for Codeforces 102617J - Frosting Patterns is missing from the prompt, and I could not determine the actual task details reliably from the information provided.

Practice › Codeforces Solutions › mBIT Rookie November 2019 ›

CF 102617I - Ice Cream

There is a line of huts, each hut containing some number of people. The huts are equally spaced, and the input gives the population of every hut. Existing ice cream shops are also placed on the same line at given coordinates. We need to choose the coordinate of one new shop.

Practice › Codeforces Solutions › mBIT Rookie November 2019 ›

CF 102617H - Cinnamon Spiral

I cannot write a reliable editorial for this problem from the information provided because the actual statement, input format, output format, and samples are missing.

Practice › Codeforces Solutions › mBIT Rookie November 2019 ›

CF 102617G - Number Cookies

I can write the editorial, but the problem statement section in your prompt is empty, so I do not have enough information to produce a correct algorithm, proof, code, and tests without guessing.

Practice › Codeforces Solutions › mBIT Rookie November 2019 ›

CF 102617F - Baking Pan

The problem describes a set of circular cookies that must fit inside a rectangular baking pan. Each cookie has a center on a coordinate plane and a radius.

Practice › Codeforces Solutions › mBIT Rookie November 2019 ›

CF 102617E - Genotypes

I can write the editorial, but the actual problem statement for Codeforces 102617E - Genotypes is missing from your prompt. I do not have enough information to determine the required algorithm, constraints, samples, or edge cases without risking inventing details.

Practice › Codeforces Solutions › mBIT Rookie November 2019 ›

CF 102617C - Patisserie

I need the actual problem details to write a correct editorial, especially the input, output, constraints, and examples. Could you provide the statement or a link to the problem? Waiting for your answer

Practice › Codeforces Solutions › mBIT Rookie November 2019 ›

CF 102617N - Pie Predicament

We have several pie types, and every pie in a row belongs to exactly one type. Two people must divide the pies between them, but the division happens by type rather than by individual pie. If a person receives one pie of some type, that person must receive every pie of that type.

Practice › Codeforces Solutions › mBIT Rookie November 2019 ›

CF 102617M - Magical Calendar

We have a calendar where a week can have any number of days from 1 to r. For a chosen week length k, the calendar is drawn as rows of k cells. We paint n consecutive days and look at the connected shape formed by those cells.

Practice › Codeforces Solutions › mBIT Rookie November 2019 ›

CF 102617K - Dessert Islands

The map describes a chocolate swamp as a rectangular grid. Each cell is either solid cookie land (S) or liquid chocolate (L). Cells only connect through their four sides, so diagonal contact does not merge regions.

Practice › Codeforces Solutions › mBIT Rookie November 2019 ›

CF 102617D - Sugar Cubes

I can write the full editorial, but the actual problem statement for Codeforces 102617D - Sugar Cubes is missing from the prompt, and I cannot reliably reconstruct the required algorithm from the title alone.

Practice › Codeforces Solutions › mBIT Rookie November 2019 ›

CF 102617A - Rating System

The problem models a one versus one match in a game. Chloe has a current rating, and she plays against another player with a given rating. The winner receives 10 percent of the loser's rating as gained points, while the loser loses 10 percent of their own rating.