2020 Google Code Jam Round 1C (GCJ 20 Round 1C)

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

3 items

2020 Google Code Jam Round 1C (GCJ 20 Round 1C)

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

#	Problem	Time	✓
A	Overexcited Fan	53s	✓
B	Overrandomized	1m 3s	✓
C	Oversized Pancake Choppers	46s	✓

Practice › Codeforces Solutions › 2020 Google Code Jam Round 1C (GCJ 20 Round 1C) ›

CF 104630B - Overrandomized

Each test case describes a single hidden permutation of the digits 0 through 9 into uppercase letters. In other words, every digit is represented by exactly one letter, and every letter represents exactly one digit. The server encodes numbers using this unknown substitution.

Practice › Codeforces Solutions › 2020 Google Code Jam Round 1C (GCJ 20 Round 1C) ›

CF 104630A - Overexcited Fan

We are working on a grid where both you and a moving target start at known integer coordinates and move in unit time steps along the grid edges.

Practice › Codeforces Solutions › 2020 Google Code Jam Round 1C (GCJ 20 Round 1C) ›

CF 104630C - Oversized Pancake Choppers

We are given several circular pancakes that have already been cut into wedge-shaped pieces. Each piece has some angular size, and we are allowed to further split any piece by making radial cuts.