Returns to the Origin

Difficulty: 1000 2000 ms 128 MB

implementation

Following the same U/D/L/R moves from (0, 0), count how many times the walker is back at the origin after a move.

Input: one line with the move string S.

Output: the number of times the position equals (0, 0) after a move.

Constraints:

• 1 ≤ |S| ≤ 10⁵

Sample Tests

UDLR

2

UD

1

Read the Editorial