Croc Champ 2013 - Round 2

Solutions for Croc Champ 2013 - Round 2 (contest 293). 4/4 problems verified against sample I/O. Difficulty range: 1500-2700.

4 items

Croc Champ 2013 - Round 2

Type: Special | Problems: 4 | Verified: 4/4 | Rating range: 1500-2700 | Time: 8m 33s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Weird Game	1500	games, greedy	53s	✓
C	Cube Problem	2400	brute-force, math, number-theory	1m 36s	✓
D	Ksusha and Square	2700	geometry, math, probabilities	1m 59s	✓
E	Close Vertices	2700	data-structures, divide-and-conquer, trees	4m 5s	✓

Practice › Codeforces Solutions › Croc Champ 2013 - Round 2 ›

CF 293A - Weird Game

We are asked to analyze a turn-based game played by two players, Yaroslav and Andrey, each starting with a binary string of length 2·n.

Practice › Codeforces Solutions › Croc Champ 2013 - Round 2 ›

We are looking for the number of positive integer triples $(a,b,c)$ such that three smaller cubes of sizes $a^3$, $b^3$, and $c^3$ together are short of exactly $n$ unit cubes when trying to build one large cube of side length $a+b+c$.

Practice › Codeforces Solutions › Croc Champ 2013 - Round 2 ›

CF 293D - Ksusha and Square

We are given a convex polygon with integer coordinates. Inside this polygon, including its boundary, there are finitely many lattice points. We choose two distinct lattice points uniformly at random, then construct a square whose diagonal is the segment between those two points.

Practice › Codeforces Solutions › Croc Champ 2013 - Round 2 ›

CF 293E - Close Vertices

We are given a weighted tree with n vertices. Every edge contributes two different quantities to a path. The first quantity is the path length, meaning the number of edges on the path. The second quantity is the path weight, meaning the sum of edge weights on the path.

Croc Champ 2013 - Round 2

Croc Champ 2013 - Round 2

CF 293A - Weird Game

CF 293C - Cube Problem

CF 293D - Ksusha and Square

CF 293E - Close Vertices