lqybzx的专栏

背景 夜夜很贪玩。 描述 威尼斯是著名的水城。由n个岛和m座桥。岛从1到n编号。 夜夜是一名到威尼斯游玩的游客，她觉得每个岛都很有意思。因此她每次都会随机选择一个与当前岛相邻的岛去参观【同一座岛可以重复参观】。每座桥有一个权值At, 走过这座桥需要花费At个单位的时间, 桥可以双向通过。 夜夜初始在1号岛，她希望最终能到n号岛去。 那么夜夜到达n号岛的期望时间是

Problem Description Zhu and 772002 are both good at math. One day, Zhu wants to test the ability of 772002, so he asks 772002 to solve a math problem.  But 772002 has a appointment with his girl

Problem Description Young theoretical computer scientist Fxx has a tree. You are given a rooted tree with n vertices,numbered from 1 to n(vertex 1 is the root).Each vertex of the tree has a valu