Codeforces Round 138 (Div. 2)

Solutions for Codeforces Round 138 (Div. 2) (contest 224). 2/2 problems verified against sample I/O. Difficulty range: 1100-1500.

2 items

Codeforces Round 138 (Div. 2)

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

Problem Name Rating Tags Solve Time Verified
A Parallelepiped 1100 brute-force, geometry, math 1m 1s ✓
B Array 1500 bitmasks, implementation, two-pointers 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