CCC 2010: J4 Up and Down v. 2

# CCC 2010 Problem J4: Up and Down
# By Kyle Zhou

import math
class Player:
    def __init__(self, forward, back, limit):
    # get the parameters for player
        self.steps = 0
        self.forward = forward
        self.back = back
        self.limit = limit
        self.find_steps()

    def find_steps(self):
        # Find number of full iterations of pattern
        full = math.floor(self.limit / (self.forward + self.back))

        # find the number of extra steps completed
        extra = self.limit % (self.forward + self.back)

        # Determine of steps completed after full iterations of pattern
        steps = (self.forward - self.back) * full

        # now determine how many extra steps to add
        if extra == self.forward:
            self.steps += self.forward

        elif extra <= self.forward:
            self.steps += extra

        elif extra > self.forward:
            self.steps += self.forward
            self.steps -= extra - self.forward

    def get_steps(self):
        return self.steps


def main():
    # getting values for Nikky
    a = input()
    b = input()

    # getting values for Byron
    c = input()
    d = input()

    # getting max steps allowed
    s = input()

    # Creating Player classes for each player
    nikky = Player(a, b, s)
    byron = Player(c, d, s)

    # Get the displacement of the two players
    n = nikky.get_steps()
    b = byron.get_steps()

    # Who's farther?
    if n < b:
        print "Byron"

    elif n > b:
        print "Nikky"

    else:
        print "Tied"

    return

if __name__ == "__main__":
    main()