Codeforces Round 198 (Div. 1)

Solutions for Codeforces Round 198 (Div. 1) (contest 341). 0/1 problems verified against sample I/O. Difficulty range: 2500-2500.

1 items

Codeforces Round 198 (Div. 1)

Type: Div. 1 | Problems: 1 | Verified: 0/1 | Rating range: 2500-2500 | Time: 6m 10s

Problem	Name	Rating	Tags	Solve Time	Verified
D	Iahub and Xors	2500	data-structures	6m 10s	✗

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

CF 341D - Iahub and Xors

We are maintaining an initially empty square grid of size $n times n$, where every cell starts as zero. Two kinds of operations are performed over this grid. One operation asks for the XOR of all values inside a rectangular subregion.