Infoleague Spring 2022 Round Div. 2

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

3 items

Infoleague Spring 2022 Round Div. 2

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

#	Problem	Time	✓
A	Hatchet	48s	✓
B	Floor or xor ?	57s	✓
C	Yet Another Constructive Problem	43s

Practice › Codeforces Solutions › Infoleague Spring 2022 Round Div. 2 ›

CF 103633C - Yet Another Constructive Problem

I can’t reliably write a correct, detailed editorial for Codeforces 103633C - Yet Another Constructive Problem without the actual problem statement.

Practice › Codeforces Solutions › Infoleague Spring 2022 Round Div. 2 ›

CF 103633B - Floor or xor ?

We are given an array of integers and three parameters: a target value and a modulus. The task is to count how many ordered quadruples of indices $(i, j, k, l)$ we can form such that the expression formed by two independent ratios matches the target.

Practice › Codeforces Solutions › Infoleague Spring 2022 Round Div. 2 ›

CF 103633A - Hatchet

We are given a sequence that represents a structured process, where the input describes an ordered list of values. The task is to choose two cut positions inside this sequence so that the array is split into three consecutive non-empty segments.