Codeforces Round 276 (Div. 1)

Solutions for Codeforces Round 276 (Div. 1) (contest 484). 0/4 problems verified against sample I/O. Difficulty range: 1700-2500.

4 items

Codeforces Round 276 (Div. 1)

Type: Div. 1 | Problems: 4 | Verified: 0/4 | Rating range: 1700-2500 | Time: 26m 55s

Problem Name Rating Tags Solve Time Verified
A Bits 1700 bitmasks, constructive-algorithms 5m 23s ✗
B Maximum Value 2100 binary-search, math, sortings 10m 57s ✗
D Kindergarten 2400 data-structures, dp, greedy 5m 17s ✗
E Sign on Fence 2500 binary-search, constructive-algorithms, data-structures 5m 18s ✗
Practice › Codeforces Solutions › Codeforces Round 276 (Div. 1) ›

CF 484A - Bits

Codeforces 484A: Bits
codeforces competitive-programming bitmasks constructive-algorithms May 31, 2026
Practice › Codeforces Solutions › Codeforces Round 276 (Div. 1) ›

CF 484B - Maximum Value

We are given a list of integers, and we are allowed to pick two positions in it, say one value acts as a dividend and the other as a divisor. The only restriction is that the dividend must be at least as large as the divisor.
codeforces competitive-programming binary-search math sortings two-pointers May 31, 2026
Practice › Codeforces Solutions › Codeforces Round 276 (Div. 1) ›

CF 484D - Kindergarten

Codeforces 484D: Kindergarten
codeforces competitive-programming data-structures dp greedy May 31, 2026
Practice › Codeforces Solutions › Codeforces Round 276 (Div. 1) ›

CF 484E - Sign on Fence

Codeforces 484E: Sign on Fence
codeforces competitive-programming binary-search constructive-algorithms data-structures May 31, 2026