Codeforces Round 246 (Div. 2)

Solutions for Codeforces Round 246 (Div. 2) (contest 432). 2/2 problems verified against sample I/O. Difficulty range: 800-2300.

2 items

Codeforces Round 246 (Div. 2)

Type: Div. 2 | Problems: 2 | Verified: 2/2 | Rating range: 800-2300 | Time: 4m 1s

Problem Name Rating Tags Solve Time Verified
A Choosing Teams 800 greedy, implementation, sortings 1m 21s ✓
E Square Tiling 2300 constructive-algorithms, greedy 2m 40s ✓
Practice › Codeforces Solutions › Codeforces Round 246 (Div. 2) ›

CF 432A - Choosing Teams

We are given a set of students at a university, each with a record of how many times they have already participated in the ACM ICPC world championship.
codeforces competitive-programming greedy implementation sortings May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 246 (Div. 2) ›

CF 432E - Square Tiling

We are asked to color an $n times m$ grid such that every contiguous region of the same color forms a square. Each square can be of any size, as long as it is a perfect square in shape and does not overlap another square of the same color.
codeforces competitive-programming constructive-algorithms greedy May 29, 2026