Codeforces Round 564 (Div. 2)

Solutions for Codeforces Round 564 (Div. 2) (contest 1173). 2/2 problems verified against sample I/O. Difficulty range: 800-1100.

2 items

Codeforces Round 564 (Div. 2)

Type: Div. 2 | Problems: 2 | Verified: 2/2 | Rating range: 800-1100 | Time: 8m 48s

Problem Name Rating Tags Solve Time Verified
A Nauuo and Votes 800 greedy 1m 38s ✓
B Nauuo and Chess 1100 constructive-algorithms, greedy 7m 10s ✓
Practice › Codeforces Solutions › Codeforces Round 564 (Div. 2) ›

CF 1173B - Nauuo and Chess

We are asked to place numbered pieces from 1 to n onto an m by m grid. Each piece i is placed at a cell with integer coordinates.
codeforces competitive-programming constructive-algorithms greedy Jun 13, 2026
Practice › Codeforces Solutions › Codeforces Round 564 (Div. 2) ›

CF 1173A - Nauuo and Votes

The problem asks us to determine the outcome of a simple voting scenario. There are three categories of voters: some are guaranteed to upvote, some are guaranteed to downvote, and some are undecided. The input gives the counts of each group.
codeforces competitive-programming greedy Jun 12, 2026