2017 Google Code Jam Round 1C (GCJ 17 Round 1C)

3 problems from 2017 Google Code Jam Round 1C (GCJ 17 Round 1C) (contest 104585), difficulty -. 3/3 solutions verified against sample I/O.

3 items

2017 Google Code Jam Round 1C (GCJ 17 Round 1C)

Special | 3 problems | 3/3 verified | Difficulty - | 2m 50s

#	Problem	Time	✓
A	Ample Syrup	1m 1s	✓
B	Parenting Partnering	55s	✓
C	Core Training	54s	✓

Practice › Codeforces Solutions › 2017 Google Code Jam Round 1C (GCJ 17 Round 1C) ›

CF 104585A - Ample Syrup

We are given a collection of cylindrical pancakes, each described by a radius and a height. We must choose exactly K of them and stack them vertically. The stacking order is fixed once the chosen set is decided: larger radius pancakes go lower, and smaller radius ones go higher.

Practice › Codeforces Solutions › 2017 Google Code Jam Round 1C (GCJ 17 Round 1C) ›

CF 104585B - Parenting Partnering

We are given a full day of 1440 minutes, and two people who must share responsibility for a baby over the entire day.

Practice › Codeforces Solutions › 2017 Google Code Jam Round 1C (GCJ 17 Round 1C) ›

CF 104585C - Core Training

We are given a collection of independent components, each of which works correctly with some probability. The system succeeds only if at least a threshold number of these components work.