※ 引述《offday (life's struggle)》之銘言：
: let T=(V,E) be a tree with |V|= n , how many distinct paths are there in T ?
there will be lgn layer
for the kth layer
it will have 2^k paths
lgn
Σ 2^i
i=0
--
i think it is right...
--
我會忘記你的 每天.......
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 140.119.162.50