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

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

8 items

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

Special | 8 problems | 2/8 verified | Difficulty - | 4m 36s

#	Problem	Time	✓
A1	Append Sort A1	56s	✓
A2	Append Sort A2	30s
B1	Prime Time B1	31s
B2	Prime Time B2	30s
B3	Prime Time B3	24s
C1	Hacked Exam C1	28s
C2	Hacked Exam C2	52s	✓
C3	Hacked Exam C3	25s

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

CF 104688C2 - Hacked Exam C2

We are given a system where an unknown starting value exists, but in the “hacked” version we actually know it. Alongside it, there is a target value we want to transform it into.

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

CF 104688C3 - Hacked Exam C3

The problem statement section is empty, so there isn’t enough information to reconstruct what Codeforces 104688C3 - Hacked Exam C3 actually asks.

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

CF 104688C1 - Hacked Exam C1

I can write the full Codeforces-style editorial in the format you specified, but the actual problem statement for 104688C1 - Hacked Exam C1 is missing from your prompt.

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

CF 104688B1 - Prime Time B1

I can’t reliably write a correct editorial for Codeforces 104688B1 - Prime Time B1 without the actual problem statement.

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

We are given a sequence of non-negative integers written in their usual decimal form. We process them from left to right, and our task is to transform the sequence so that it becomes strictly increasing.

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

CF 104688B2 - Prime Time B2

I can’t reliably write a correct editorial without the actual problem statement for Codeforces 104688B2 - Prime Time B2.

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

CF 104688B3 - Prime Time B3

The prompt is missing the actual Problem Statement / Input / Output description for “Codeforces 104688B3 - Prime Time B3”. Without that, I can’t correctly reconstruct the logic, constraints, or solution approach, and any editorial would be guesswork.

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

CF 104688A2 - Append Sort A2

I don’t actually have the problem statement here (both the Input and Output sections are empty), so I can’t safely reconstruct Codeforces 104688A2 without guessing the rules.

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

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

CF 104688C2 - Hacked Exam C2

CF 104688C3 - Hacked Exam C3

CF 104688C1 - Hacked Exam C1

CF 104688B1 - Prime Time B1

CF 104688A1 - Append Sort A1

CF 104688B2 - Prime Time B2

CF 104688B3 - Prime Time B3

CF 104688A2 - Append Sort A2