2015 Google Code Jam World Finals (GCJ 15 World Finals)

6 problems from 2015 Google Code Jam World Finals (GCJ 15 World Finals) (contest 104560), difficulty -. 6/6 solutions verified against sample I/O.

6 items

2015 Google Code Jam World Finals (GCJ 15 World Finals)

Special | 6 problems | 6/6 verified | Difficulty - | 6m 48s

# Problem Rating Tags Accepted Time ✓
A Costly Binary Search 1m 18s ✓
B Campinatorics 1m 23s ✓
C Pretty Good Proportion 1m 8s ✓
D Taking Over The World 52s ✓
E Merlin QA 59s ✓
F Crane Truck 1m 8s ✓
Practice › Codeforces Solutions › 2015 Google Code Jam World Finals (GCJ 15 World Finals) ›

CF 104560F - Crane Truck

We are simulating a program executed by a crane truck moving around a circular warehouse with 240 storage positions. Each position holds a number of crates, initially all set to one.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › 2015 Google Code Jam World Finals (GCJ 15 World Finals) ›

CF 104560E - Merlin QA

We are given a sorted array, but instead of caring about the values inside it, we care about the cost structure of probing it. When we run a binary search to find an insertion position, every time we compare against an index i, we pay a cost ai.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › 2015 Google Code Jam World Finals (GCJ 15 World Finals) ›

CF 104560D - Taking Over The World

We are given an undirected graph where vertex 0 is the starting point of a security team and vertex N − 1 is the target location containing a critical objective.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › 2015 Google Code Jam World Finals (GCJ 15 World Finals) ›

CF 104560B - Campinatorics

We are asked to count structured ways of filling an $N times N$ grid with “tents”, where each chosen cell contains exactly one tent and each tent hosts a family of size 1, 2, or 3.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › 2015 Google Code Jam World Finals (GCJ 15 World Finals) ›

CF 104560A - Costly Binary Search

We are given a sorted array, but instead of caring about the values inside it, we care about the cost structure of probing it. When we run a binary search to find an insertion position, every time we compare against an index i, we pay a cost ai.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › 2015 Google Code Jam World Finals (GCJ 15 World Finals) ›

CF 104560C - Pretty Good Proportion

We are given a binary string and a target real value $F$ between 0 and 1. For any substring, we can compute its fraction of ones as $frac{1}{text{length}}$.
codeforces competitive-programming Jun 30, 2026