Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

能说说你的复杂度么?O( 质数个数 * Log431 ) 这个方法也会超么? 质数个数为83

Posted by forgotten at 2006-09-16 17:02:46 on Problem 2992
In Reply To:a[i][j] 表示 i! 中 j 的最高次幂 Posted by:sunmoonstar_love at 2006-09-16 15:56:36


Followed by:

Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top


All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator