2015 Google Code Jam Round 1C (GCJ 15 Round 1C)

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

3 items

2015 Google Code Jam Round 1C (GCJ 15 Round 1C)

Special | 3 problems | 3/3 verified | Difficulty - | 3m 55s

#	Problem	Time	✓
A	Brattleship	2m	✓
B	Typewriter Monkey	57s	✓
C	Less Money, More Problems	58s	✓

Practice › Codeforces Solutions › 2015 Google Code Jam Round 1C (GCJ 15 Round 1C) ›

CF 104551A - Brattleship

The failure is not geometric and not related to the convex hull logic at all. Both samples crash before any computation begins: This happens when a function defines or implicitly shadows sys inside its scope, so Python treats sys as a local variable instead of the imported…

Practice › Codeforces Solutions › 2015 Google Code Jam Round 1C (GCJ 15 Round 1C) ›

CF 104551C - Less Money, More Problems

We are given a currency system consisting of several existing coin denominations, each a positive integer. When paying for something, you are allowed to use at most C coins of each denomination.

Practice › Codeforces Solutions › 2015 Google Code Jam Round 1C (GCJ 15 Round 1C) ›

CF 104551B - Typewriter Monkey

A monkey is typing characters by repeatedly pressing random keys from a fixed keyboard. Each key press is independent and follows a known probability distribution over the available letters.