https://www.hackerrank.com/challenges/saveprincess2

bot_saves_princess_2.py

import math
def nextMove(n,r,c,grid):
    princess = ()
    for row in range(n):
        for col in range(len(grid[row])):
            if grid[row][col] == 'p':
                princess = (row, col)
                break
    m = (r, c)
    x = princess[0] - m[0]
    y = princess[1] - m[1]
    
    if x != 0:
        dir = 'DOWN' if x > 0 else 'UP'
    elif y != 0:
        dir = 'RIGHT' if y > 0 else 'LEFT'
    else :
        print((x, y))
    return dir
    

n = int(input())
r,c = [int(i) for i in input().strip().split()]
grid = []
for i in range(0, n):
    grid.append(input())

print(nextMove(n,r,c,grid))