summaryrefslogtreecommitdiff
path: root/introductory_problems/readme.md
diff options
context:
space:
mode:
authorJack Sangdahl <[email protected]>2025-02-20 09:50:31 -0700
committerJack Sangdahl <[email protected]>2025-02-20 09:50:31 -0700
commit844264c0bc2777d0e952196ab383f1dc004e6f81 (patch)
tree3574e6c1c29557e3c05af6e698da419c0bdb9ad3 /introductory_problems/readme.md
parent91491fa92ae64f36e8277849d0943d20b82093bc (diff)
downloadcses-844264c0bc2777d0e952196ab383f1dc004e6f81.tar.gz
cses-844264c0bc2777d0e952196ab383f1dc004e6f81.zip
1625. grid paths
Diffstat (limited to 'introductory_problems/readme.md')
-rw-r--r--introductory_problems/readme.md7
1 files changed, 7 insertions, 0 deletions
diff --git a/introductory_problems/readme.md b/introductory_problems/readme.md
index 0046f00..8d11138 100644
--- a/introductory_problems/readme.md
+++ b/introductory_problems/readme.md
@@ -97,3 +97,10 @@ Consider an infinite string that consists of all positive integers in increasing
**Input**: The first input line has an integer `q`: the number of queries. After this, there are `q` lines that describe the queries. Each line has an integer `k`: a 1-indexed position in the string. (Example: 3 7 19 12)
**Output**: For each query, print the corresponding digit. (Example: 7 4 1)
+
+### Grid Paths
+There are 88418 paths in a 7 * 7 grid from the upper-left square to the lower-left square. Each path corresponds to a 48-character description consisting of characters D (down), U (up), L (left), and R (right). You are given a description of a path which may also contain certain characters ? (any direction). Your task is to calculate the number of paths that match the description.
+
+**Input**: The only input line has a 48-character string of characters ?, D, U, L, and R. (Example: ??????R??????U??????????????????????????LD????D?)
+
+**Output**: Print one integer: the total number of paths. (Example: 201)