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

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

3 items

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

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

#	Problem	Time	✓
A	Senate Evacuation	1m 9s	✓
B	Slides!	1m 23s	✓
C	Fashion Police	1m 4s	✓

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

CF 104565B - Slides!

We are asked to construct a directed graph on B nodes, represented by an adjacency matrix, such that the number of distinct directed paths from node 1 to node B is exactly M. Each path is a sequence of vertices where every consecutive pair must have a directed edge.

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

CF 104565A - Senate Evacuation

We are given several independent evacuation scenarios. In each scenario there are a few political parties, each with some number of senators. The only action allowed is to repeatedly remove either one senator or two senators in a single step.

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

CF 104565C - Fashion Police

We are asked to build as many valid outfits as possible using three types of clothing: jackets, pants, and shirts. Each outfit is a triple consisting of one item from each category.