Short Problem Definition:
Two cats and a mouse are at various positions on a line. You will be given their starting positions. Your task is to determine which cat will reach the mouse first, assuming the mouse doesn’t move and the cats travel at equal speed. If the cats arrive at the same time, the mouse will be allowed to move and it will escape while they fight.
Link
Complexity:
time complexity is O(1)
space complexity is O(1)
Execution:
This feels like a very simplistic version of Codility Fish. Just implement the specification.
Solution:
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
|
#!/bin/pythonimport sysq = int(raw_input().strip())for a0 in xrange(q): x,y,z = raw_input().strip().split(' ') x,y,z = [int(x),int(y),int(z)] catA = abs(x-z) catB = abs(y-z) if (catA < catB): print "Cat A" elif (catB < catA): print "Cat B" else: print "Mouse C" |
