The 16-th BIT Campus Programming Contest - Online Round

13 problems from The 16-th BIT Campus Programming Contest - Online Round (contest 103401), difficulty -. 2/13 solutions verified against sample I/O.

13 items

The 16-th BIT Campus Programming Contest - Online Round

Special | 13 problems | 2/13 verified | Difficulty - | 11m 8s

#	Problem	Time	✓
A	15 Puzzle	2m 26s
B	SVM	55s	✓
C	Easy Nim	39s
D	Hard Nim	30s
E	Power tower	29s
F	lzd is a scout	30s
G	Environmental friendly	24s
H	Observe	26s
I	Broken routers	50s	✓
J	League schedule	28s
K	Simple Math	2m 26s
L	Carrot Fantasy	33s
M	Debug it!	32s

Practice › Codeforces Solutions › The 16-th BIT Campus Programming Contest - Online Round ›

CF 103401K - Simple Math

Let $a{s+t-1}dots a1a0$ be the binary representation of an $(s,t)$-combination, so each $ai in {0,1}$ and $sum ai = t$. A rotation of a prefix of length $j+1$ is the transformation $$aj a{j-1}dots a0 ;leftarrow; a{j-1}dots a0 aj,$$ with all other digits unchanged.

Practice › Codeforces Solutions › The 16-th BIT Campus Programming Contest - Online Round ›

CF 103401M - Debug it!

I can’t write a correct editorial for Codeforces 103401M - Debug it! because the actual problem statement (input/output rules and constraints) is missing from your prompt.

Practice › Codeforces Solutions › The 16-th BIT Campus Programming Contest - Online Round ›

CF 103401L - Carrot Fantasy

I can’t reliably write a correct editorial here because the actual problem statement for “Codeforces 103401L - Carrot Fantasy” is missing from your prompt.

Practice › Codeforces Solutions › The 16-th BIT Campus Programming Contest - Online Round ›

CF 103401I - Broken routers

We are given a sequence of points on a 2D grid. A robot starts at the origin and must visit these points in order, where “visiting” means the robot must physically reach each coordinate in sequence.

Practice › Codeforces Solutions › The 16-th BIT Campus Programming Contest - Online Round ›

CF 103401J - League schedule

I can write the full editorial in the exact style you want, but the problem statement for Codeforces 103401J - League schedule is not included in your prompt. Right now there is no description of: - what entities are involved (teams, rounds, constraints, etc.

Practice › Codeforces Solutions › The 16-th BIT Campus Programming Contest - Online Round ›

CF 103401A - 15 Puzzle

Practice › Codeforces Solutions › The 16-th BIT Campus Programming Contest - Online Round ›

CF 103401H - Observe

I can write a full editorial in the exact format you requested, but I’m missing one essential piece: the actual problem statement for Codeforces 103401H - Observe.

Practice › Codeforces Solutions › The 16-th BIT Campus Programming Contest - Online Round ›

CF 103401G - Environmental friendly

The problem statement for Codeforces 103401G - Environmental friendly is missing from your prompt, so I can’t reconstruct a correct editorial without risking inventing details.

Practice › Codeforces Solutions › The 16-th BIT Campus Programming Contest - Online Round ›

CF 103401F - lzd is a scout

I can write the full editorial in the exact format you want, but I’m missing the actual problem statement for Codeforces 103401F - lzd is a scout.

Practice › Codeforces Solutions › The 16-th BIT Campus Programming Contest - Online Round ›

CF 103401E - Power tower

I can’t produce a correct editorial yet because the statement that was retrieved for 103401E - Power tower is incomplete and inconsistent across sources.

Practice › Codeforces Solutions › The 16-th BIT Campus Programming Contest - Online Round ›

CF 103401D - Hard Nim

The editorial can’t be written correctly yet because the actual problem statement for Codeforces 103401D - Hard Nim is missing.

Practice › Codeforces Solutions › The 16-th BIT Campus Programming Contest - Online Round ›

CF 103401B - SVM

We are given a set of training examples, each example has a vector of scores over multiple classes and a correct label.

Practice › Codeforces Solutions › The 16-th BIT Campus Programming Contest - Online Round ›

CF 103401C - Easy Nim

I can’t write a correct Codeforces editorial without the actual problem statement. Right now the prompt only contains the title “Easy Nim”, but no description of the game rules, input format, or required output.