Codeforces Round 198 (Div. 1)

2 problems from Codeforces Round 198 (Div. 1) (contest 341), difficulty 2500-3000. 0/2 solutions verified against sample I/O.

2 items

Codeforces Round 198 (Div. 1)

Div. 1 | 2 problems | 0/2 verified | Difficulty 2500-3000 | 4m 16s

#	Problem	Rating	Tags	Accepted	Time	✓
D	Iahub and Xors	2500	data-structures	1,383	2m 26s
E	Candies Game	3000	constructive-algorithms, greedy	576	1m 50s

Practice › Codeforces Solutions › Codeforces Round 198 (Div. 1) ›

CF 341D - Iahub and Xors

We are given an $n times n$ matrix initially filled with zeros. The problem asks us to handle two types of operations efficiently: one that computes the xor of all elements inside a submatrix, and another that xors a given value into every element of a submatrix.

Practice › Codeforces Solutions › Codeforces Round 198 (Div. 1) ›

CF 341E - Candies Game

We are given a set of boxes, each containing some number of candies. The objective is to redistribute candies such that exactly two boxes contain all the candies, and every other box is empty.