SRM147 DIV1 500

一般编程题

class Dragons:
    def snaug(self, initialFood, rounds):
        neighbors = [[2,3,4,5], [2,3,4,5], [0,1,4,5], [0,1,4,5], [0,1,2,3], [0,1,2,3]]
        amounts = [x for x in initialFood]
        for i in range(rounds):
            a = [0, 0, 0, 0, 0, 0]
            for k in range(0, 6):
                for j in range(0, 4):
                    a[k] += amounts[neighbors[k][j]] # / 4
            amounts = a
            
        x = amounts[2]
        y = 2 * rounds
        for i in range(0, 2*rounds):
            if x % 2 == 0:
                x = x / 2
                y = y - 1
            else:
                break
        
        if y == 0:
            return str(int(x))
        else:
            return str(int(x)) + '/' + str(2**y)
        

# test
o = Dragons()

# test case
assert(o.snaug((0, 0, 4, 0, 0, 0), 2) == "1")
assert(o.snaug((0, 0, 4, 0, 0, 0), 3) == '1/2')

print('ok')