题解 | #坐标移动#

def zuoBiao(a):
    eff = []	#存储有效数据，以便进行计算
    move = ['A','D','S','W']	#存储4个方向位
    data = ['0','1','2','3','4','5','6','7','8','9']	#判断方向位后面是否是纯数字
    x , y = 0 , 0	#初始坐标
    for i in range(len(a)):
        if len(a[i]) > 0 and a[i][0] in move:
            count = 0
            for j in range(len(a[i][1:])):
                if a[i][j+1] in data:
                    count = count + 1
                else:
                    break
            if count == len(a[i]) - 1:
                eff.append(a[i])
        else:
            continue
    for i in range(len(eff)):
        if eff[i][0] == 'A':
            x = x - int(eff[i][1:])
        elif eff[i][0] == 'D':
            x = x + int(eff[i][1:])
        elif eff[i][0] == 'S':
            y = y - int(eff[i][1:])
        else:
            y = y + int(eff[i][1:])
    
    print('{},{}'.format(x,y))


if __name__ == '__main__':
    a = input().split(';')
    zuoBiao(a)