Codeforces Round 276 (Div. 2)

Solutions for Codeforces Round 276 (Div. 2) (contest 485). 0/2 problems verified against sample I/O. Difficulty range: 1300-1400.

2 items

Codeforces Round 276 (Div. 2)

Type: Div. 2 | Problems: 2 | Verified: 0/2 | Rating range: 1300-1400 | Time: 16m 31s

Problem Name Rating Tags Solve Time Verified
A Factory 1400 implementation, math, matrices 5m 22s ✗
B Valuable Resources 1300 brute-force, greedy 11m 9s ✗
Practice › Codeforces Solutions › Codeforces Round 276 (Div. 2) ›

CF 485A - Factory

Codeforces 485A: Factory
codeforces competitive-programming implementation math matrices May 31, 2026
Practice › Codeforces Solutions › Codeforces Round 276 (Div. 2) ›

CF 485B - Valuable Resources

We are asked to build a square city on a 2D Cartesian map such that it encloses all given mines, represented as points with integer coordinates. The sides of the square must remain parallel to the axes, and our goal is to minimize the area of the square.
codeforces competitive-programming brute-force greedy May 31, 2026