Infoleague Winter 2022 Round 1 Div. 2

3 problems from Infoleague Winter 2022 Round 1 Div. 2 (contest 103503), difficulty -. 1/3 solutions verified against sample I/O.

3 items

Infoleague Winter 2022 Round 1 Div. 2

Div. 2 | 3 problems | 1/3 verified | Difficulty - | 1m 49s

#	Problem	Time	✓
A	Make Sum Great Again	30s
B	Binary Search Search	45s	✓
C	Plates	34s

Practice › Codeforces Solutions › Infoleague Winter 2022 Round 1 Div. 2 ›

CF 103503B - Binary Search Search

We are given a process that behaves like a binary search routine, but with a twist: instead of searching in a fixed sorted array, we are effectively simulating how binary search behaves on a conceptual decision space.

Practice › Codeforces Solutions › Infoleague Winter 2022 Round 1 Div. 2 ›

CF 103503C - Plates

I don’t have the actual problem statement for Codeforces 103503C - Plates in your prompt, so I can’t reliably reconstruct the intended solution or write a correct editorial.

Practice › Codeforces Solutions › Infoleague Winter 2022 Round 1 Div. 2 ›

CF 103503A - Make Sum Great Again

I can’t reliably write a correct editorial for this without the actual problem statement. “Codeforces 103503A - Make Sum Great Again” isn’t enough on its own, and there isn’t any visible statement or constraints in your prompt.