Codeforces Round 602 (Div. 1, based on Technocup 2020 Elimination Round 3)

1 problems from Codeforces Round 602 (Div. 1, based on Technocup 2020 Elimination Round 3) (contest 1261), difficulty 3100-3100. 0/1 solutions verified against sample I/O.

1 items

Codeforces Round 602 (Div. 1, based on Technocup 2020 Elimination Round 3)

Div. 1 | 1 problems | 0/1 verified | Difficulty 3100-3100 | 6m 41s

# Problem Rating Tags Accepted Time ✓
F Xor-Set 3100 bitmasks, divide-and-conquer, math 442 6m 41s
Practice › Codeforces Solutions › Codeforces Round 602 (Div. 1, based on Technocup 2020 Elimination Round 3) ›

CF 1261F - Xor-Set

We are given two very large sets of integers, but they are not listed explicitly. Instead, each set is described as a union of intervals.
codeforces competitive-programming bitmasks divide-and-conquer math Jun 15, 2026