227A - Where do I Turn - CodeForces Solution


geometry *1300

Please click on ads to support us..

Python Code:




















import math

a1, a2 = [int(x) for x in input().split()]
b1, b2 = [int(x) for x in input().split()]
c1, c2 = [int(x) for x in input().split()]

diff1 = (b1-a1, b2-a2)
diff2 = (c1-b1, c2-b2)

def get_theta_angle(d):
	if(d[0] == 0):
		if(d[1] > 0):
			return math.pi / 2
		else:
			return 3 * math.pi / 2
	elif(d[0] > 0):
		return math.atan(d[1]/d[0])
	else:
		return math.atan(d[1]/d[0]) + math.pi

def correct_large_diff(angle1, angle2):
	if(angle1 > angle2 + math.pi):
		angle2 = angle2 + 2 * math.pi
	elif(angle2 > angle1 + math.pi):
		angle1 = angle1 + 2 * math.pi
	return angle1, angle2

angle1 = get_theta_angle(diff1)
angle2 = get_theta_angle(diff2)

angle1, angle2 = correct_large_diff(angle1, angle2)

if(angle1 - angle2 == 0):
	print("TOWARDS")
if(angle1 - angle2 < 0):
	print("LEFT")
if(angle1 - angle2 > 0):
	print("RIGHT")












Comments

Submit
0 Comments
More Questions

165B - Burning Midnight Oil
17A - Noldbach problem
1350A - Orac and Factors
1373A - Donut Shops
26A - Almost Prime
1656E - Equal Tree Sums
1656B - Subtract Operation
1656A - Good Pairs
1367A - Short Substrings
87A - Trains
664A - Complicated GCD
1635D - Infinite Set
1462A - Favorite Sequence
1445B - Elimination
1656C - Make Equal With Mod
567A - Lineland Mail
1553A - Digits Sum
1359B - New Theatre Square
766A - Mahmoud and Longest Uncommon Subsequence
701B - Cells Not Under Attack
702A - Maximum Increase
1656D - K-good
1426A - Floor Number
876A - Trip For Meal
1326B - Maximums
1635C - Differential Sorting
961A - Tetris
1635B - Avoid Local Maximums
20A - BerOS file system
1637A - Sorting Parts