Skip to content

Commit 2cc95fa

Browse files
authored
Create q001.md for Grid Paths problem
Add problem statement for Grid Paths challenge
1 parent 05f6039 commit 2cc95fa

1 file changed

Lines changed: 16 additions & 0 deletions

File tree

Lines changed: 16 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1 +1,17 @@
1+
# Grid Paths
12

3+
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:
4+
- `D` — down
5+
- `U` — up
6+
- `L` — left
7+
- `R` — right
8+
9+
You are given a description of a path which may also contain characters **? (any direction)**. Your task is to calculate the **number of paths** that match the description.
10+
11+
# INPUT
12+
The only input line has a 48-character string of characters ?, D, U, L and R.
13+
14+
# OUTPUT
15+
Print one integer: the total number of paths.
16+
17+
[PROBLEM LINK](https://cses.fi/problemset/task/1625)

0 commit comments

Comments
 (0)