Solution for https://www.hackerrank.com/challenges/find-point/problem

find-point.py

#!/bin/python3

import os, sys, math

def reflectionComponent(pcomp, qcomp):
    if pcomp > qcomp:
        return qcomp - abs(qcomp - pcomp)
    elif pcomp < qcomp:
        return qcomp + abs(qcomp - pcomp)
    else:
        return qcomp
    
def findPoint(px, py, qx, qy):
    rx = reflectionComponent(px, qx)
    ry = reflectionComponent(py, qy)
    return rx, ry

if __name__ == '__main__':
    fptr = open(os.environ['OUTPUT_PATH'], 'w')

    n = int(input())

    for n_itr in range(n):
        pxPyQxQy = input().split()

        px = int(pxPyQxQy[0])

        py = int(pxPyQxQy[1])

        qx = int(pxPyQxQy[2])

        qy = int(pxPyQxQy[3])

        result = findPoint(px, py, qx, qy)

        fptr.write(' '.join(map(str, result)))
        fptr.write('\n')

    fptr.close()