|
Download 2023/finals/programming_paths_part_2_sol.md from hackercupai/hackercup: direct link, hf CLI and curl.
- Browser
- Download file 414 Bytes
-
https://huggingface.co/datasets/hackercupai/hackercup/resolve/main/2023/finals/programming_paths_part_2_sol.md
- Command line
-
hf download hf://datasets/hackercupai/hackercup/2023/finals/programming_paths_part_2_sol.md
-
curl -L -o programming_paths_part_2_sol.md https://huggingface.co/datasets/hackercupai/hackercup/resolve/main/2023/finals/programming_paths_part_2_sol.md
414 Bytes
| The same observations we used for chapter 1 also apply to chapter 2, we simply need to find a more compact way to create a long path with alcoves. We need a main path of about length \(40\) to make any number up to \(10{,}000\). | |
| Here's a possible approach that fits on a \(10\) × \(10\) grid: | |
| ``` | |
| @.....#.#. | |
| #.#.#.#... | |
| .#.#..#.#. | |
| .....#..#. | |
| #.#.#..##. | |
| ...#.#.#.. | |
| .#.#.#..#. | |
| ..#...#.#. | |
| #...#....# | |
| ..#..#.#.. | |
| ``` | |