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 组合爆炸.

请您先登陆，再发跟帖！