mBIT Standard November 2020

12 problems from mBIT Standard November 2020 (contest 102859), difficulty -. 4/12 solutions verified against sample I/O.

12 items

mBIT Standard November 2020

Special | 12 problems | 4/12 verified | Difficulty - | 7m 36s

#	Problem	Time	✓
A	Apple Pie	51s	✓
B	Double Trouble	23s
C	Explorers	23s
D	Banquet	50s	✓
E	Climbing Trees	49s
F	Weights	53s	✓
G	Stone Piles	21s
H	Number Game	25s
I	Heating Rocks	1m 10s	✓
J	Calendars	21s
K	Cathedral	29s
L	Gemstones	41s

Practice › Codeforces Solutions › mBIT Standard November 2020 ›

CF 102859E - Climbing Trees

I can absolutely write that editorial, but I don't have the actual problem statement for Codeforces 102859E - Climbing Trees. The prompt you provided contains only the template, with the sections: - Problem Statement - Input - Output all empty.

Practice › Codeforces Solutions › mBIT Standard November 2020 ›

CF 102859B - Double Trouble

I don't have enough information to write a correct editorial for this problem because the prompt does not include the actual problem statement.

Practice › Codeforces Solutions › mBIT Standard November 2020 ›

CF 102859L - Gemstones

I can absolutely write that editorial, but I don't have the actual problem statement for Codeforces 102859L - Gemstones.

Practice › Codeforces Solutions › mBIT Standard November 2020 ›

CF 102859K - Cathedral

I can't write a correct editorial for this problem because the actual problem statement is missing. The prompt only includes the title: Codeforces 102859K - Cathedral but the Problem Statement, Input, and Output sections are empty.

Practice › Codeforces Solutions › mBIT Standard November 2020 ›

CF 102859J - Calendars

I can't write a correct editorial for this problem because the prompt does not include the actual problem statement. The title, input, and output sections are empty, so there is no way to determine the algorithm, prove its correctness, or produce valid code and test cases.

Practice › Codeforces Solutions › mBIT Standard November 2020 ›

CF 102859H - Number Game

I can absolutely write that editorial, but I don't have the actual problem statement for Codeforces 102859H - Number Game.

Practice › Codeforces Solutions › mBIT Standard November 2020 ›

CF 102859G - Stone Piles

I can absolutely write that editorial, but I don't have the actual problem statement for Codeforces 102859G "Stone Piles", and the prompt you provided has empty Problem Statement, Input, and Output sections.

Practice › Codeforces Solutions › mBIT Standard November 2020 ›

CF 102859C - Explorers

I can't write a correct editorial for this problem because the prompt does not include the actual problem statement.

Practice › Codeforces Solutions › mBIT Standard November 2020 ›

CF 102859I - Heating Rocks

We have a row of n stoves. Stove i contains some number of stones p[i], where the amount must stay between 0 and v. The total number of stones placed on all stoves must be exactly s. Between every pair of neighboring stoves there is a compartment.

Practice › Codeforces Solutions › mBIT Standard November 2020 ›

CF 102859F - Weights

We have a collection of weights. We know the multiset of their masses, but the physical weights are indistinguishable, so we do not know which object has which mass.

Practice › Codeforces Solutions › mBIT Standard November 2020 ›

CF 102859D - Banquet

We have a circular arrangement of N dishes, where each dish is represented by a lowercase letter. A sample is any consecutive sequence of dishes taken clockwise or counter-clockwise around the circle. The task is to count how many different strings can appear as samples.

Practice › Codeforces Solutions › mBIT Standard November 2020 ›

CF 102859A - Apple Pie

The sequence we want to recover is an Euler tour of a complete graph. Each number from 1 to N is a vertex, and writing two different numbers next to each other means traversing the edge connecting those two vertices.