This post is all about the solution of the B. Mex Master Codeforces Round 858 (Div. 2) Problem solution.

B. Mex Master Codeforces Round 858 (Div. 2) Problem solution

Codeforces

Problem Statement :

You are given an n-dimensional array a. The MEX of [a1+a2,a2+a3,...,an1+an] is the score of a. Find the minimum score of an if you can rearrange the elements of an in any order. It is important to note that you are not required to create the array a with the lowest possible score.
An array's MEX (minimum excluded) is the smallest non-negative integer that is not in the array. As an example:
The MEX of [2,2,1] is 0\s, because 0\s does not belong to the array.
The MEX of [3,1,0,1] is 2 because 0 and 1 are in the array but 2 is not.
The MEX of [0,3,1,2] is 4 because 0, 1, 2, and 3 are from the



Format of Input :

Timofey visited a well-known summer school and discovered a tree with n vertices. A tree is an undirected connected graph with no cycles.
Except for c0, every vertex in this tree is white. The vertex c0 is black in colour.
Timofey wishes to make all of the vertices of this tree black. He uses n1 operations to accomplish this. During the i-th operation, he selects the currently white vertex ci and paints it black.
Let us define tree positivity as the shortest distance between all pairs of different black vertices in it. The number of edges on the path from v to u is the distance between the vertices v and u.
Timofey wants to know the current state of affairs after each operation.

Format of the Output :

For every test case, print three strings a, b, and c separated by spaces on a single line — capybara names, such that writing them without spaces results in a line s. ab and cb, or ba and bc, must be satisfied.

If you have several options for restoring the names, print any of them. If the names are unable to be recovered, print ":(" (without quotes)


Also Check this out:-


A. Walking Master Codeforces Round 858 (Div. 2) Problem solution, Click Here
B. Mex Master Codeforces Round 858 (Div. 2) Problem solution, Click Here
C. Sequence Master Codeforces Round 858 (Div. 2) Problem solution, Click Here
D. DSU Master Codeforces Round 858 (Div. 2) Problem solution, Click Here
Solution of the Problem: Click Here