Codeforces--626A--Robot Sequence

题目描述：
Calvin the robot lies in an infinite rectangular grid. Calvin’s source code contains a list of n commands, each either ‘U’, ‘R’, ‘D’, or ‘L’ — instructions to move a single square up, right, down, or left, respectively. How many ways can Calvin execute a non-empty contiguous substrings of commands and return to the same square he starts in? Two substrings are considered different if they have different starting or ending indices.
输入描述:
The first line of the input contains a single positive integer, n (1 ≤ n ≤ 200) — the number of commands.

The next line contains n characters, each either ‘U’, ‘R’, ‘D’, or ‘L’ — Calvin’s source code.
输出描述:
Print a single integer — the number of contiguous substrings that Calvin can execute and return to his starting square.
输入：
6
URLLDR
4
DLUU
7
RLRLRLR
输出：
2
0
12
题意：
给出一个操作串，UDLR分别表示机器人向上下左右走一步，问这个串有多少非空子串使得操作完这个子串后机器人回到原地
题解：
直接暴力
代码：

#include<cstdio>
#include<cstring>