http://zwiftblog.com/route-details/
APS(D[][])
FOR k in 1->n
FOR i in 1->n (단 i not k)
FOR j in 1->n (단 j not k & j not i )
D[i][j] = min(D[i][k] + D[k][j], D[i],[j])
이항계수
B[][] <- {-1}
bino(n,r)
IF r == 0 or n == r : return 1
IF B[n][r] != -1
RETURN B[n][r]
B[n][r] <- bino1(n-1, r-1) + bino(n-1, r)
RETURN
