Codeforces Round 940 (Div. 2) and CodeCraft-23

Solutions for Codeforces Round 940 (Div. 2) and CodeCraft-23 (contest 1957). 1/2 problems verified against sample I/O. Difficulty range: 800-1100.

2 items

Codeforces Round 940 (Div. 2) and CodeCraft-23

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

Problem	Name	Rating	Tags	Solve Time	Verified
A	Stickogon	800	constructive-algorithms, greedy	43s	✓
B	A BIT of a Construction	1100	bitmasks, constructive-algorithms, greedy	3m 57s	✗

Practice › Codeforces Solutions › Codeforces Round 940 (Div. 2) and CodeCraft-23 ›

CF 1957A - Stickogon

We are given a collection of sticks, each with an integer length. The goal is to build as many regular polygons as possible using these sticks, with the restriction that each side of a polygon must be exactly one stick, and no stick can be reused.

Practice › Codeforces Solutions › Codeforces Round 940 (Div. 2) and CodeCraft-23 ›

CF 1957B - A BIT of a Construction

We are asked to construct a sequence of n non-negative integers that sum to a given value k, while maximizing the number of distinct 1 bits in the binary representation of their bitwise OR.