Codeforces Round 545 (Div. 2)

Solutions for Codeforces Round 545 (Div. 2) (contest 1138). 1/2 problems verified against sample I/O. Difficulty range: 900-1800.

2 items

Codeforces Round 545 (Div. 2)

Type: Div. 2 | Problems: 2 | Verified: 1/2 | Rating range: 900-1800 | Time: 2m 45s

Problem Name Rating Tags Solve Time Verified
A Sushi for Two 900 binary-search, greedy, implementation 1m 12s ✓
B Circus 1800 brute-force, greedy, math 1m 33s ✗
Practice › Codeforces Solutions › Codeforces Round 545 (Div. 2) ›

CF 1138B - Circus

We have a troupe of n circus artists, where n is guaranteed to be even. Each artist may have the skill of being a clown, an acrobat, both, or neither.
codeforces competitive-programming brute-force greedy math strings Jun 12, 2026
Practice › Codeforces Solutions › Codeforces Round 545 (Div. 2) ›

CF 1138A - Sushi for Two

We are given a row of sushi pieces, where each piece is either type 1 or type 2. We want to choose one contiguous segment of this row. A segment is valid if it consists of two consecutive blocks of different sushi types, and both blocks have the same size.
codeforces competitive-programming binary-search greedy implementation Jun 12, 2026