2021 Google Code Jam Round 1C (GCJ 21 Round 1C)

6 problems from 2021 Google Code Jam Round 1C (GCJ 21 Round 1C) (contest 104692), difficulty -. 2/6 solutions verified against sample I/O.

6 items

2021 Google Code Jam Round 1C (GCJ 21 Round 1C)

Special | 6 problems | 2/6 verified | Difficulty - | 3m 58s

#	Problem	Time	✓
A1	Closest Pick A1	31s
A2	Closest Pick A2	34s
B1	Roaring Years B1	34s
B2	Roaring Years B2	28s
C1	Double or NOTing C1	45s	✓
C2	Double or NOTing C2	1m 6s	✓

Practice › Codeforces Solutions › 2021 Google Code Jam Round 1C (GCJ 21 Round 1C) ›

CF 104692C2 - Double or NOTing C2

We are given a fixed array b that defines how neighboring positions in another array interact through a repeated randomized update process.

Practice › Codeforces Solutions › 2021 Google Code Jam Round 1C (GCJ 21 Round 1C) ›

CF 104692C1 - Double or NOTing C1

We are given a starting integer and a target integer. From the starting value, we can repeatedly apply two transformations. One operation doubles the current number, which in binary corresponds to shifting left and appending a zero bit.

Practice › Codeforces Solutions › 2021 Google Code Jam Round 1C (GCJ 21 Round 1C) ›

CF 104692B2 - Roaring Years B2

I’m missing the actual problem statement for Codeforces 104692B2 - Roaring Years B2 in your prompt (the “Problem Statement / Input / Output” sections are empty).

Practice › Codeforces Solutions › 2021 Google Code Jam Round 1C (GCJ 21 Round 1C) ›

CF 104692A2 - Closest Pick A2

I cannot see the statement for Codeforces 104692A2 - Closest Pick A2 in your prompt or in the retrieved context, so I cannot safely reconstruct the exact rules, constraints, or intended solution.

Practice › Codeforces Solutions › 2021 Google Code Jam Round 1C (GCJ 21 Round 1C) ›

CF 104692B1 - Roaring Years B1

I can’t write a correct editorial for this yet because the actual problem statement for Codeforces 104692B1 - Roaring Years B1 is missing from your prompt.

Practice › Codeforces Solutions › 2021 Google Code Jam Round 1C (GCJ 21 Round 1C) ›

CF 104692A1 - Closest Pick A1

I can write the full editorial, but I’m missing one critical piece: the actual statement of Codeforces 104692A1 - Closest Pick A1. Right now the “Problem Statement / Input / Output” sections are empty in your prompt, so I don’t know: - what the “picks” are (array?