Testing Round 6

Solutions for Testing Round 6 (contest 306). 1/4 problems verified against sample I/O. Difficulty range: 800-2300.

4 items

Testing Round 6

Type: Special | Problems: 4 | Verified: 1/4 | Rating range: 800-2300 | Time: 10m 15s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Candies	800	implementation	3m 20s	✗
B	Optimizer	2100	data-structures, greedy, sortings	1m 26s	✓
C	White, Black and White Again	2100	combinatorics, number-theory	3m 20s	✗
D	Polygon	2300	constructive-algorithms, geometry	2m 9s	✗

Practice › Codeforces Solutions › Testing Round 6 ›

CF 306A - Candies

Polycarpus has a certain number of candies and a number of friends. He wants to distribute all the candies among his friends in such a way that every friend gets a positive number of candies, and the difference between the friend who receives the most candies and the friend…

Practice › Codeforces Solutions › Testing Round 6 ›

CF 306B - Optimizer

We are given a linear memory array of size n and a set of m instructions, each of which sets a contiguous block of memory to the value 13. The instructions are indexed in the input order. Some instructions may overlap, fully or partially, with others.

Practice › Codeforces Solutions › Testing Round 6 ›

CF 306C - White, Black and White Again

We are asked to compute the number of ways to distribute a set of good and not-so-good events across a sequence of days divided into three consecutive segments: a white segment, a black segment, and a second white segment.

Practice › Codeforces Solutions › Testing Round 6 ›

CF 306D - Polygon

We need to construct a convex polygon with exactly n vertices such that every interior angle is equal, but every side length is different. A polygon where all angles are equal is called equiangular. For a convex equiangular polygon, the direction of each edge is fixed.