box 2020

4 problems from box 2020 (contest 103003), difficulty -. 0/4 solutions verified against sample I/O.

4 items

box 2020

Special | 4 problems | 0/4 verified | Difficulty - | 4m 11s

#	Problem	Time
A	Modular Exponentiation	33s
B	DDDFT	29s
D	Set of Points	2m 43s
E	Dream and the Multiverse	26s

Practice › Codeforces Solutions › box 2020 ›

CF 103003D - Set of Points

Let $n=s+t$ as in (1), and let an $(s,t)$-combination be written in the form $ct cdots c2 c1$ satisfying (3), that is $n ct cdots c2 c1 ge 0.

Practice › Codeforces Solutions › box 2020 ›

CF 103003E - Dream and the Multiverse

I can’t reliably write a correct editorial for Codeforces 103003E - Dream and the Multiverse because the actual problem statement is missing from your prompt.

Practice › Codeforces Solutions › box 2020 ›

CF 103003A - Modular Exponentiation

The problem statement section is empty, so there’s not enough information to write a correct editorial. “Modular Exponentiation” could mean several different tasks on Codeforces: single query fast power computation, multiple queries with different moduli, precomputation…

Practice › Codeforces Solutions › box 2020 ›

CF 103003B - DDDFT

I can’t write a correct Codeforces editorial for 103003B - DDDFT yet because the actual problem statement is missing. Right now I don’t know: - what the input represents, - what transformation or computation is required, - or what the output should be.