Codeforces Round 138 (Div. 2)

2 problems from Codeforces Round 138 (Div. 2) (contest 224), difficulty 1100-1500. 2/2 solutions verified against sample I/O.

2 items

Codeforces Round 138 (Div. 2)

Div. 2 | 2 problems | 2/2 verified | Difficulty 1100-1500 | 2m 3s

# Problem Rating Tags Accepted Time ✓
A Parallelepiped 1100 brute-force, geometry, math 30,279 1m 1s ✓
B Array 1500 bitmasks, implementation, two-pointers 7,909 1m 2s ✓
Practice › Codeforces Solutions › Codeforces Round 138 (Div. 2) ›

CF 224A - Parallelepiped

We are given three positive integers representing the areas of three faces of a rectangular parallelepiped that meet at a single vertex.
codeforces competitive-programming brute-force geometry math May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 138 (Div. 2) ›

CF 224B - Array

We are given an array of integers and a number k. The task is to find a contiguous subarray, or segment, such that it contains exactly k distinct integers.
codeforces competitive-programming bitmasks implementation two-pointers May 29, 2026