2016 Google Code Jam Round 1A (GCJ 16 Round 1A)

3 problems from 2016 Google Code Jam Round 1A (GCJ 16 Round 1A) (contest 104563), difficulty -. 3/3 solutions verified against sample I/O.

3 items

2016 Google Code Jam Round 1A (GCJ 16 Round 1A)

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

#	Problem	Time	✓
A	The Last Word	47s	✓
B	Rank and File	50s	✓
C	BFFs	1m 12s	✓

Practice › Codeforces Solutions › 2016 Google Code Jam Round 1A (GCJ 16 Round 1A) ›

CF 104563C - BFFs

We are given a directed functional graph: every child points to exactly one “best friend forever”. We want to choose a subset of children and arrange them in a circle so that each child in that circle sits next to their BFF on at least one side.

Practice › Codeforces Solutions › 2016 Google Code Jam Round 1A (GCJ 16 Round 1A) ›

CF 104563B - Rank and File

We are given a hidden $N times N$ grid of integers representing soldier heights. The grid is very structured: each row is strictly increasing from left to right, and each column is strictly increasing from top to bottom.

Practice › Codeforces Solutions › 2016 Google Code Jam Round 1A (GCJ 16 Round 1A) ›

CF 104563A - The Last Word

We are given a string of uppercase letters. We reveal it one character at a time, and at each step we are allowed to insert the new character either at the front or at the back of a growing string. After processing all characters, we obtain a final word.