import sys
sys.stdin = open("input.txt")
from collections import deque
input = sys.stdin.readline
'''
시간 초과 해결이 어려워 구글링 ㅜ
'''
def solve(x):
visited = set()
q = deque()
q.append((x, ""))
visited.add(x)
while q:
cur, cmd = q.popleft()
if cur == b:
return cmd
for k in ["D", "S", "L", "R"]:
if k == "D":
nxt = cur * 2
if nxt > 9999:
nxt = nxt % 10000
elif k == "S":
nxt = cur - 1
if nxt == -1:
nxt = 9999
elif k == "L":
front = cur % 1000
back = cur // 1000
nxt = front * 10 + back
elif k == "R":
front = cur % 10
back = cur // 10
nxt = front * 1000 + back
if nxt not in visited:
q.append((nxt, cmd + k))
visited.add(nxt)
T = int(input())
for _ in range(T):
a, b = map(int, input().split())
print(solve(a))
댓글남기기