Codeforces Round 143 (Div. 2)

Solutions for Codeforces Round 143 (Div. 2) (contest 231). 3/3 problems verified against sample I/O. Difficulty range: 800-1600.

3 items

Codeforces Round 143 (Div. 2)

Type: Div. 2 | Problems: 3 | Verified: 3/3 | Rating range: 800-1600 | Time: 5m 32s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Team	800	brute-force, greedy	56s	✓
B	Magic, Wizardry and Wonders	1500	constructive-algorithms, greedy	1m 38s	✓
C	To Add or Not to Add	1600	binary-search, sortings, two-pointers	2m 58s	✓

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

CF 231A - Team

We are asked to determine how many problems a team of three friends will attempt during a programming contest. Each friend independently has confidence about each problem, represented as a binary value: 1 if the friend is confident they know the solution, 0 otherwise.

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

CF 231B - Magic, Wizardry and Wonders

We are given an array of distinct integers. At every operation, we inspect the first element of the current array. If that first element is currently the smallest remaining value in the array, we remove it. Otherwise, we rotate it by moving it from the front to the back.

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

CF 231C - To Add or Not to Add

We are given an array of integers and a limited number of increment operations. Each operation increases a single element by one, and the same element can be increased multiple times.