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 |
能说说你的复杂度么?O( 质数个数 * Log431 ) 这个方法也会超么? 质数个数为83In Reply To:a[i][j] 表示 i! 中 j 的最高次幂 Posted by:sunmoonstar_love at 2006-09-16 15:56:36 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator