Codeforces Round 941 (Div. 2)

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

2 items

Codeforces Round 941 (Div. 2)

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

Problem	Name	Rating	Tags	Solve Time	Verified
A	Card Exchange	800	constructive-algorithms, games, greedy	1m 12s	✗
B	Rectangle Filling	1100	constructive-algorithms, implementation	1m 8s	✗

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

CF 1966A - Card Exchange

We are given a multiset of cards, where each card carries an integer label. The only allowed operation takes exactly k cards that all share the same label and removes them, replacing them with k-1 new cards whose labels we are free to choose arbitrarily.

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

CF 1966B - Rectangle Filling

We are given a grid of size $n times m$ composed of white and black squares. The task is to determine whether it is possible to make all squares in the grid the same color using a specific operation any number of times.