2019 Google Code Jam Round 1B (GCJ 19 Round 1B)

6 problems from 2019 Google Code Jam Round 1B (GCJ 19 Round 1B) (contest 104649), difficulty -. 1/6 solutions verified against sample I/O.

6 items

2019 Google Code Jam Round 1B (GCJ 19 Round 1B)

Special | 6 problems | 1/6 verified | Difficulty - | 3m 17s

# Problem Rating Tags Accepted Time ✓
A1 Manhattan Crepe Cart A1 33s
A2 Manhattan Crepe Cart A2 32s
B1 Draupnir B1 34s
B2 Draupnir B2 46s ✓
C1 Fair Fight C1 21s
C2 Fair Fight C2 31s
Practice › Codeforces Solutions › 2019 Google Code Jam Round 1B (GCJ 19 Round 1B) ›

CF 104649C2 - Fair Fight C2

I can write the full editorial in the exact style you want, but the problem statement for Codeforces 104649C2 - Fair Fight C2 isn’t included here, so I’d risk reconstructing the wrong task.
codeforces competitive-programming Jun 29, 2026
Practice › Codeforces Solutions › 2019 Google Code Jam Round 1B (GCJ 19 Round 1B) ›

CF 104649C1 - Fair Fight C1

Codeforces 104649C1: Fair Fight C1
codeforces competitive-programming Jun 29, 2026
Practice › Codeforces Solutions › 2019 Google Code Jam Round 1B (GCJ 19 Round 1B) ›

CF 104649B1 - Draupnir B1

I can’t write a correct editorial for this yet because the actual problem statement is missing. Right now I only see the title “Codeforces 104649B1 - Draupnir B1”, but no description, input/output format, or constraints.
codeforces competitive-programming Jun 29, 2026
Practice › Codeforces Solutions › 2019 Google Code Jam Round 1B (GCJ 19 Round 1B) ›

CF 104649A1 - Manhattan Crepe Cart A1

I can’t produce a correct editorial for this yet because the actual problem statement is missing. Right now I only know the title, “Manhattan Crepe Cart A1”, but I don’t have the rules, input format, constraints, or what is being optimized.
codeforces competitive-programming Jun 29, 2026
Practice › Codeforces Solutions › 2019 Google Code Jam Round 1B (GCJ 19 Round 1B) ›

CF 104649A2 - Manhattan Crepe Cart A2

I don’t have the actual statement of Codeforces 104649A2 - Manhattan Crepe Cart A2 in your prompt, and I can’t reliably reconstruct it from the title alone without risking inventing details that don’t match the problem.
codeforces competitive-programming Jun 29, 2026
Practice › Codeforces Solutions › 2019 Google Code Jam Round 1B (GCJ 19 Round 1B) ›

CF 104649B2 - Draupnir B2

The problem describes a process that evolves over discrete time, where contributions appear and then grow in a very specific way. At each moment in time, some new units are introduced.
codeforces competitive-programming Jun 29, 2026