Croc Champ 2013 - Round 2

5 problems from Croc Champ 2013 - Round 2 (contest 293), difficulty 1500-2700. 1/5 solutions verified against sample I/O.

5 items

Croc Champ 2013 - Round 2

Special | 5 problems | 1/5 verified | Difficulty 1500-2700 | 11m 32s

# Problem Rating Tags Accepted Time ✓
A Weird Game 1500 games, greedy 3,195 5m 1s ✓
B Distinct Paths 2700 brute-force, combinatorics 941 2m 30s
C Cube Problem 2400 brute-force, math, number-theory 635 2m 37s
D Ksusha and Square 2700 geometry, math, probabilities 261 43s
E Close Vertices 2700 data-structures, divide-and-conquer, trees 1,978 41s
Practice › Codeforces Solutions › Croc Champ 2013 - Round 2 ›

CF 293B - Distinct Paths

Codeforces 293B: Distinct Paths
codeforces competitive-programming brute-force combinatorics Jun 5, 2026
Practice › Codeforces Solutions › Croc Champ 2013 - Round 2 ›

CF 293A - Weird Game

We are asked to analyze a turn-based game between two players, Yaroslav and Andrey, who each have a binary string of length 2·n. They alternately pick positions from the combined index set {1, 2, …, 2·n}.
codeforces competitive-programming games greedy Jun 5, 2026
Practice › Codeforces Solutions › Croc Champ 2013 - Round 2 ›

CF 293E - Close Vertices

We are given a tree with n vertices, where each edge carries a non-negative weight. For any two vertices, the distance between them can be measured in two ways: the number of edges along the path connecting them, and the sum of edge weights along that path.
codeforces competitive-programming data-structures divide-and-conquer trees Jun 5, 2026
Practice › Codeforces Solutions › Croc Champ 2013 - Round 2 ›

CF 293D - Ksusha and Square

We are given a convex polygon whose vertices have integer coordinates. Consider every lattice point, meaning every point with integer coordinates, that lies inside the polygon or on its boundary.
codeforces competitive-programming geometry math probabilities two-pointers Jun 5, 2026
Practice › Codeforces Solutions › Croc Champ 2013 - Round 2 ›

CF 293C - Cube Problem

The three original cubes had side lengths $a$, $b$, and $c$. Their total number of unit cubes was $$a^3+b^3+c^3.$$ Vitaly wanted to build one larger cube whose side length was $a+b+c$, which would require $$(a+b+c)^3$$ unit cubes.
codeforces competitive-programming brute-force math number-theory Jun 5, 2026