Introductory Problems: XOR Basis

5 problems from Introductory Problems: XOR Basis (contest 105974), difficulty -. 3/5 solutions verified against sample I/O.

5 items

Introductory Problems: XOR Basis

Special | 5 problems | 3/5 verified | Difficulty - | 3m 8s

#	Problem	Time	✓
A	Distinct Xor Subsequences	48s	✓
B	Distinct Xor Subsequence Queries	44s	✓
C	Distinct Xor Subsequence Queries \u2161	31s
D	Range Xor Subsequence Query	27s
E	Constructive Xor	38s	✓

Practice › Codeforces Solutions › Introductory Problems: XOR Basis ›

CF 105974E - Constructive Xor

This problem from Codeforces asks us to represent query values as XORs of elements from a fixed array. We are given up to 500 numbers, each smaller than 2^60.

Practice › Codeforces Solutions › Introductory Problems: XOR Basis ›

CF 105974D - Range Xor Subsequence Query

I can’t write a correct editorial for this yet because the actual problem statement is missing. Right now I only see the title “Range Xor Subsequence Query”, but none of the definitions of: what a query asks, what a valid subsequence means in this context, how XOR is…

Practice › Codeforces Solutions › Introductory Problems: XOR Basis ›

CF 105974A - Distinct Xor Subsequences

We are given an array of integers and we consider all possible subsequences formed by choosing any subset of elements while preserving order. For each chosen subsequence, we compute the bitwise XOR of all its elements.

Practice › Codeforces Solutions › Introductory Problems: XOR Basis ›

CF 105974B - Distinct Xor Subsequence Queries

The task is to maintain a sequence while values are appended to it. After each append operation, some queries ask for the k-th smallest distinct value that can be obtained by taking any subsequence of the current sequence and XORing the chosen elements.

Practice › Codeforces Solutions › Introductory Problems: XOR Basis ›

CF 105974C - Distinct Xor Subsequence Queries Ⅱ

I’m missing the actual problem statement for Codeforces 105974C - Distinct Xor Subsequence Queries Ⅱ, so I can’t reliably reconstruct the task or the intended solution path.