I'm sorry for typing ; thang for thank,Erler for Euler

來源: jinjing 於 2010-04-15 08:13:18 [] [舊帖] [給我悄悄話] 閱讀數 : (115 bytes)
回答: 組合爆炸 由 jinjing 於 2010-04-14 17:53:40

Find a Hph is not difficult,but find the best (Exp:best path for 200 cities trip road)is not easy,we meet 組合爆炸.

請您先登陸，再發跟帖！