 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
那可是标程阿~~Waterloo那帮人写的代码还真是晦涩阿，也许是我的慧根太浅了...In Reply To:看着标程的复杂度是O(2^(2*n)+n^5)，不信它可以过，交了居然是6**MS。 Posted by:porsche at 2008-07-15 16:53:50 Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
