 |
| ||||
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 | |||||||||
那位大哥指点一下，如何把时间减少啊？我用欧几里德扩展算法的迭代形式时，用数组来模拟栈，最后效果和直接用递归效果好像差不多样，不知到那些0ms的值怎么弄得，还有欧几里德扩展算法的迭代算法是否应该用栈模拟递归调用时的栈来实现？ Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
