Matrix test | Python Fiddle

from fractions import Fraction

def answer(m):
    s_denom = []
    prob_m = [[0 for a in range(len(m))] for b in range(len(m))]
    prob = [[0] for a in range(len(m))]
    start_vector = [0 for a in range(len(m))]
    start_vector[0] = 1
    
    #calculate denominators for each state (0 = terminal state)
    s_denom = [sum(m[x]) for x in range(len(m))]
    
    #convert items in m to probabilities in Fraction() form
    for i in range(len(m)):
        for j in range(len(m[0])):
            if s_denom[i] != 0:
                m[i][j] = Fraction(m[i][j] / s_denom[i]).limit_denominator(100)
                
        # Convert terminal rows to unity
        if s_denom[i] == 0:
            m[i][i] = 1
    
    #iterate new m transitional matrix using Markov Chain principle
    for i in range(len(m)):
        for j in range(len(m)):
            prob_m[i][j] = sum((Fraction(m[i][k] * m[k][j]).limit_denominator(100) for k in range(len(m)))
    
    #iterate matrix m^n 50 times to find a steady state
    for z in range(50):
        for i in range(len(m)):
            for j in range(len(m)):
                for k in range(len(m)):
                    prob_m[i][j] = Fraction(prob_m[i][k] * m[k][j]).limit_denominator(100)
    
    #apply start_vector to determine steady state probabilities for each state
    for i in range(len(m)):
        for j in range(1):
            prob[i][j] = sum(Fraction(start_vector[k] * prob_m[k][i]).limit_denominator(100) for k in range(len(m)))
    
    
    return prob
    
matrix = [[0,1,0,0,0,1],[4,0,0,3,2,0],[0,0,0,0,0,0],[0,0,0,0,0,0],[0,0,0,0,0,0],[0,0,0,0,0,0]]

answer(matrix)

Browser Version Not Supported

Due to Python Fiddle's reliance on advanced JavaScript techniques, older browsers might have problems running it correctly. Please download the latest version of your favourite browser.
Chrome 10+ Firefox 4+ Safari 5+
IE 10+

Let me try anyway!

Python Fiddle

Python Cloud IDE