2019 Google Code Jam Qualification Round (GCJ 19 Qualification Round)
10 problems from 2019 Google Code Jam Qualification Round (GCJ 19 Qualification Round) (contest 104635), difficulty -. 10/10 solutions verified against sample I/O.
2019 Google Code Jam Qualification Round (GCJ 19 Qualification Round)
Special | 10 problems | 10/10 verified | Difficulty - | 8m 16s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A1 | Foregone Solution - A1 | 46s | ✓ | |||
| A2 | Foregone Solution - A2 | 57s | ✓ | |||
| A3 | Foregone Solution - A3 | 45s | ✓ | |||
| B1 | You Can Go Your Own Way - B1 | 50s | ✓ | |||
| B2 | You Can Go Your Own Way - B2 | 47s | ✓ | |||
| B3 | You Can Go Your Own Way - B3 | 50s | ✓ | |||
| C1 | Cryptopangrams - C1 | 48s | ✓ | |||
| C2 | Cryptopangrams - C2 | 50s | ✓ | |||
| D1 | Dat Bae - D1 | 53s | ✓ | |||
| D2 | Dat Bae - D2 | 50s | ✓ |
CF 104635D2 - Dat Bae - D2
We are given a hidden set of positions labeled from 1 to N. Some of these positions are “broken”, and the rest are “working”. The number of broken positions is not directly given, but we are allowed to interactively query the system.
CF 104635D1 - Dat Bae - D1
We are dealing with a hidden binary array of length $N$. Each position corresponds to a device that is either working or broken, but we do not know which ones are which.
CF 104635C2 - Cryptopangrams - C2
We are given an encrypted message that was originally formed from a sequence of prime numbers. Each letter was first converted into a prime, and then the encryption replaced the sequence of primes with the product of every two adjacent primes.
CF 104635C1 - Cryptopangrams - C1
We are given a sequence of integers that were produced from an underlying hidden sequence of primes. Each integer represents the product of two neighboring primes in that hidden sequence.
CF 104635B3 - You Can Go Your Own Way - B3
We are given a square grid of size n by n. A person named Lydia has already chosen a path from the top-left corner to the bottom-right corner, moving only right or down.
CF 104635B1 - You Can Go Your Own Way - B1
We are given a square grid of size $N times N$. Someone else, Lydia, has already chosen a valid path from the top-left corner to the bottom-right corner, moving only right or down at each step.
CF 104635B2 - You Can Go Your Own Way - B2
We are given a single grid path that starts at the top-left corner of a square grid and reaches the bottom-right corner. The path is described as a sequence of unit moves, where each move goes either right or down. This sequence represents one valid route through the grid.
CF 104635A2 - Foregone Solution - A2
We are given a number written as a string of decimal digits. The task is to split this number into two other numbers such that adding them together reconstructs the original number exactly, digit by digit with normal base 10 addition, and neither of the two resulting numbers…
CF 104635A1 - Foregone Solution - A1
We are given a single large integer written in decimal form, and we need to split it into two non-negative integers whose sum equals the original number.
CF 104635A3 - Foregone Solution - A3
We are given a very large non-negative integer written as a string. The task is to split this number into two non-negative integers, call them A and B, such that when we add them digit-wise we recover the original number, and neither A nor B contains the digit 4 in their…