Codeforces Round 277 (Div. 2)

Solutions for Codeforces Round 277 (Div. 2) (contest 486). 0/4 problems verified against sample I/O. Difficulty range: 800-2200.

4 items

Codeforces Round 277 (Div. 2)

Type: Div. 2 | Problems: 4 | Verified: 0/4 | Rating range: 800-2200 | Time: 26m 47s

Problem Name Rating Tags Solve Time Verified
A Calculating Function 800 implementation, math 10m 49s ✗
B OR in Matrix 1300 greedy, hashing, implementation 5m 23s ✗
D Valid Sets 2100 dfs-and-similar, dp, math 5m 18s ✗
E LIS of Sequence 2200 data-structures, dp, greedy 5m 17s ✗
Practice › Codeforces Solutions › Codeforces Round 277 (Div. 2) ›

CF 486A - Calculating Function

We are given a single positive integer and asked to evaluate a function built by alternating addition and subtraction of consecutive integers starting from 1. The sequence begins by subtracting 1, then adding 2, subtracting 3, adding 4, and so on until we reach n.
codeforces competitive-programming implementation math May 31, 2026
Practice › Codeforces Solutions › Codeforces Round 277 (Div. 2) ›

CF 486B - OR in Matrix

Codeforces 486B: OR in Matrix
codeforces competitive-programming greedy hashing implementation May 31, 2026
Practice › Codeforces Solutions › Codeforces Round 277 (Div. 2) ›

CF 486D - Valid Sets

Codeforces 486D: Valid Sets
codeforces competitive-programming dfs-and-similar dp math trees May 31, 2026
Practice › Codeforces Solutions › Codeforces Round 277 (Div. 2) ›

CF 486E - LIS of Sequence

Codeforces 486E: LIS of Sequence
codeforces competitive-programming data-structures dp greedy hashing math May 31, 2026