Codeforces Round 608 (Div. 2)

4 problems from Codeforces Round 608 (Div. 2) (contest 1271), difficulty 800-2700. 1/4 solutions verified against sample I/O.

4 items

Codeforces Round 608 (Div. 2)

Div. 2 | 4 problems | 1/4 verified | Difficulty 800-2700 | 10m 26s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Suits	800	brute-force, greedy, math	15,673	2m 37s
B	Blocks	1300	greedy, math	12,097	4m 12s
C	Shawarma Tent	1300	brute-force, geometry, greedy	11,120	1m 35s	✓
F	Divide The Students	2700	brute-force	260	2m 2s

Practice › Codeforces Solutions › Codeforces Round 608 (Div. 2) ›

CF 1271B - Blocks

We are given a line of blocks, each painted either black or white. The only allowed move is to pick two neighboring blocks and flip both of them at the same time, turning white into black and black into white.

Practice › Codeforces Solutions › Codeforces Round 608 (Div. 2) ›

CF 1271F - Divide The Students

Each test case describes a single student group that must be split into two subgroups. Every subgroup has three independent “resource limits”: an auditorium limit for maths attendees, a computer lab limit for programming attendees, and a gym limit for PE attendees.

Practice › Codeforces Solutions › Codeforces Round 608 (Div. 2) ›

CF 1271A - Suits

There is not enough information to diagnose the bug or provide a corrected solution. The sample with expected output appears to belong to a string construction problem, but you have not provided: - the problem statement, - the original Python solution, - or even the name of…

Practice › Codeforces Solutions › Codeforces Round 608 (Div. 2) ›

CF 1271C - Shawarma Tent

We are working on a grid where movement is restricted to four directions, so distance between two points is measured using Manhattan distance. A school is fixed at one coordinate, and each student lives at another coordinate on the same infinite grid.