On the way, she stops in Toronto to do some sightseeing. The unfortunate thing about travelling is that everyone back home expects her to bring back pictures of everything. […] 351 m up the tower is the “360” rotating restaurant, which rotates a full 360 degrees every 72 minutes. From there, Christy can see the whole city, and take close-up pictures of all the landmarks using her fancy new 100x optical zoom camera. Since the restaurant itself rotates, she only needs to stand in one place to take pictures in all directions. […] Since the restaurant staff only realize she is a tourist once she starts taking pictures, we begin measuring the time required once she takes her first picture.

**Problem:** Sphere Online Judge (SPOJ) – Problem CNEASY

**Solution:** Afterwards this problem is really easy, however I first made it too hard. The trick is pretty easy we are looking for the biggest distance between each consecutive degree. To check the difference between the highest and the lowest I appended (lowest + 360) to the list of degrees. The + 360 helps to calculate the distance more easily. Afterwards just select the biggest difference and calculate the minimum time.

1 2 3 4 5 6 7 8 9 10 11 12 13 | from math import ceil for i in xrange(0, int(raw_input())): n = int(raw_input()) degrees = [] for i in xrange(0, n): degrees.append(float(raw_input().split()[1])) degrees.sort() degrees.append(degrees[0] + 360) maxDegrees = max([(degrees[i] - degrees[i-1]) for i in xrange(1, n + 1)]) print "%i" % (ceil ((360 - maxDegrees) * 12)) |