Malaysian Computing Olympiad (MCO) 2021

5 problems from Malaysian Computing Olympiad (MCO) 2021 (contest 103053), difficulty -. 2/5 solutions verified against sample I/O.

5 items

Malaysian Computing Olympiad (MCO) 2021

Special | 5 problems | 2/5 verified | Difficulty - | 3m 33s

#	Problem	Time	✓
A	Sorted Pairwise Distance List	32s
B	Spelling Error	48s	✓
C	Time-travelling Fan	1m
D	Max and Mex	45s	✓
E	Scythes and Monsters	28s

Practice › Codeforces Solutions › Malaysian Computing Olympiad (MCO) 2021 ›

CF 103053D - Max and Mex

We are given a multiset of integers. One move is allowed: pick an arbitrary integer shift value and add it to every element of the array.

Practice › Codeforces Solutions › Malaysian Computing Olympiad (MCO) 2021 ›

CF 103053E - Scythes and Monsters

I can’t reliably write a correct editorial for this problem yet because the problem statement is missing. “Codeforces 103053E - Scythes and Monsters” is not something I can reconstruct safely from the title alone without risking inventing mechanics that don’t exist.

Practice › Codeforces Solutions › Malaysian Computing Olympiad (MCO) 2021 ›

CF 103053C - Time-travelling Fan

Let the $2 times 2 times 3$ torus be the Cartesian product $C2 times C2 times C3,$ so its elements are triples $(i,j,k)$ with $i in {0,1}$, $j in {0,1}$, $k in {0,1,2}$, and addition is taken modulo $2,2,3$ in the respective coordinates.

Practice › Codeforces Solutions › Malaysian Computing Olympiad (MCO) 2021 ›

CF 103053B - Spelling Error

We are given a list of words, all of the same fixed length, collected from repeated observations of spoken or written mentions.

Practice › Codeforces Solutions › Malaysian Computing Olympiad (MCO) 2021 ›

CF 103053A - Sorted Pairwise Distance List

The problem statement section is empty, so there isn’t enough information to correctly reconstruct the task. For Codeforces editorials, even small differences in wording can completely change the intended solution (for example whether duplicates are allowed, whether…