The 2015 China Collegiate Programming Contest (CCPC 2015)

12 problems from The 2015 China Collegiate Programming Contest (CCPC 2015) (contest 103964), difficulty -. 8/12 solutions verified against sample I/O.

12 items

The 2015 China Collegiate Programming Contest (CCPC 2015)

Special | 12 problems | 8/12 verified | Difficulty - | 12m 11s

#	Problem	Time	✓
A	Secrete Master Plan	46s	✓
B	Build Towers	1m	✓
C	The Battle of Chibi	43s	✓
D	Pick The Sticks	53s	✓
E	Ba Gua Zhen	1m	✓
F	The Battle of Guandu	30s
G	Ancient Go	54s	✓
H	Sudoku	48s	✓
I	Mahjong	2m 32s
J	Walk Around The Campsite	51s	✓
K	Game Rooms	27s
L	Huatuo's Medicine	1m 47s

Practice › Codeforces Solutions › The 2015 China Collegiate Programming Contest (CCPC 2015) ›

CF 103964L - Huatuo's Medicine

Let $c1c2cdots cn$ be the part-count representation of a partition of $n$, so that $sum{j=1}^n j cj = n.$ The colex order on partitions corresponds to lexicographic order on the reversed vector $cn c{n-1}cdots c1$, so successive partitions are obtained by making the earliest…

Practice › Codeforces Solutions › The 2015 China Collegiate Programming Contest (CCPC 2015) ›

CF 103964F - The Battle of Guandu

I can’t write a correct editorial for this problem yet because the actual problem content is missing from your prompt (the statement section is empty).

Practice › Codeforces Solutions › The 2015 China Collegiate Programming Contest (CCPC 2015) ›

CF 103964J - Walk Around The Campsite

The task can be understood in geometric terms. Imagine a campsite drawn on a grid where some cells are occupied by tents or structures and the rest are empty ground.

Practice › Codeforces Solutions › The 2015 China Collegiate Programming Contest (CCPC 2015) ›

CF 103964K - Game Rooms

The problem statement for Codeforces 103964K - Game Rooms is not included in your prompt (it only shows a placeholder with empty Input/Output sections). Without the actual rules of the problem, any “editorial” would be guesswork and would very likely be wrong.

Practice › Codeforces Solutions › The 2015 China Collegiate Programming Contest (CCPC 2015) ›

CF 103964I - Mahjong

Let $T=binom{2t-1}{t}$ and write $x=N/T$. In Section 7.2.1.3, the number $kappa{tN}$ is expressed through the binary representation of $N$ by decomposing the corresponding $(s,t)$-combination into the associated compositions $qt,dots,q0$ of (11).

Practice › Codeforces Solutions › The 2015 China Collegiate Programming Contest (CCPC 2015) ›

CF 103964D - Pick The Sticks

We are given a line of sticks, each stick having some value or characteristic encoded in the input. A move consists of picking certain sticks according to a rule implied by the problem, and the goal is to compute the best possible outcome after performing the allowed selection…

Practice › Codeforces Solutions › The 2015 China Collegiate Programming Contest (CCPC 2015) ›

CF 103964C - The Battle of Chibi

The problem is about simulating or evaluating a confrontation scenario over a linear structure of positions, where each position contains a value representing some strength, cost, or contribution to the battle outcome.

Practice › Codeforces Solutions › The 2015 China Collegiate Programming Contest (CCPC 2015) ›

CF 103964E - Ba Gua Zhen

The task describes a transformation on a structured arrangement of elements, which you can think of as a grid or a set of positions laid out in a fixed geometry.

Practice › Codeforces Solutions › The 2015 China Collegiate Programming Contest (CCPC 2015) ›

CF 103964B - Build Towers

We are given a collection of vertical sticks, each stick holding a stack of plates. Each plate has a color and a size, and for every color there are exactly seven plates with sizes from 0 to 6.

Practice › Codeforces Solutions › The 2015 China Collegiate Programming Contest (CCPC 2015) ›

CF 103964G - Ancient Go

We are given a rectangular board that resembles the game of Go. Each cell is either empty or contains a stone belonging to one of two colors. Stones that touch orthogonally form connected groups.

Practice › Codeforces Solutions › The 2015 China Collegiate Programming Contest (CCPC 2015) ›

CF 103964A - Secrete Master Plan

The problem as given does not describe any concrete input format or required transformation, so there is no computational structure to infer beyond the fact that the program is expected to produce an output without relying on any parsed data.

Practice › Codeforces Solutions › The 2015 China Collegiate Programming Contest (CCPC 2015) ›

CF 103964H - Sudoku

We are given a partially filled 9 by 9 Sudoku grid. Each cell either already contains a digit from 1 to 9 or is empty.