Codeforces Round 609 (Div. 2)

Solutions for Codeforces Round 609 (Div. 2) (contest 1269). 1/1 problems verified against sample I/O. Difficulty range: 1500-1500.

1 items

Codeforces Round 609 (Div. 2)

Type: Div. 2 | Problems: 1 | Verified: 1/1 | Rating range: 1500-1500 | Time: 1m 58s

Problem Name Rating Tags Solve Time Verified
B Modulo Equality 1500 brute-force, sortings 1m 58s ✓
Practice › Codeforces Solutions › Codeforces Round 609 (Div. 2) ›

CF 1269B - Modulo Equality

We have two arrays of equal length. We may choose a single non-negative value x, add it to every element of the first array, and take all results modulo m. After this transformation, the order of elements does not matter.
codeforces competitive-programming brute-force sortings Jun 11, 2026