Codeforces Round 122 (Div. 1)

5 problems from Codeforces Round 122 (Div. 1) (contest 193), difficulty 1700-2900. 3/5 solutions verified against sample I/O.

5 items

Codeforces Round 122 (Div. 1)

Div. 1 | 5 problems | 3/5 verified | Difficulty 1700-2900 | 7m 36s

# Problem Rating Tags Accepted Time ✓
A Cutting Figure 1700 constructive-algorithms, graphs, trees 4,681 1m 19s ✓
B Xor 2000 brute-force 1,139 1m 7s ✓
C Hamming Distance 2400 constructive-algorithms, greedy, math 605 2m 30s
D Two Segments 2900 data-structures 608 1m 8s ✓
E Fibonacci Number 2900 brute-force, math, matrices 406 1m 32s
Practice › Codeforces Solutions › Codeforces Round 122 (Div. 1) ›

CF 193B - Xor

We are given a small system of length-n arrays that evolves through a fixed number of global transformations. We start with an array a, and we repeatedly apply exactly u operations.
codeforces competitive-programming brute-force Jun 3, 2026
Practice › Codeforces Solutions › Codeforces Round 122 (Div. 1) ›

CF 193C - Hamming Distance

We are asked to reconstruct four binary strings consisting only of letters a and b, given the Hamming distances between every pair of strings. The Hamming distance between two strings counts the positions where the strings differ.
codeforces competitive-programming constructive-algorithms greedy math matrices Jun 3, 2026
Practice › Codeforces Solutions › Codeforces Round 122 (Div. 1) ›

CF 193E - Fibonacci Number

We are given a single number $f$, and we consider the infinite sequence generated by Fibonacci rules, but taken modulo 1013. The sequence starts with 0 and 1, and every next value is the sum of the previous two, reduced modulo 1013.
codeforces competitive-programming brute-force math matrices Jun 3, 2026
Practice › Codeforces Solutions › Codeforces Round 122 (Div. 1) ›

CF 193D - Two Segments

We are given a permutation of integers from 1 to n. A permutation means each integer appears exactly once. The task is to count pairs of contiguous subarrays (segments) such that when we combine the two segments, the union of their elements forms a consecutive sequence of…
codeforces competitive-programming data-structures Jun 3, 2026
Practice › Codeforces Solutions › Codeforces Round 122 (Div. 1) ›

CF 193A - Cutting Figure

We are given a rectangular grid of size n × m representing a sheet of squared paper. Some squares are painted, forming a set A.
codeforces competitive-programming constructive-algorithms graphs trees Jun 3, 2026