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

关于这题的一点想法：

Posted by lbp at 2005-08-08 10:25:39 on Problem 2247 
用的是递归，在n-1的基础上递增，判断能否依次被2，3，5，7整除！
不过，时间是大把大把的，汗呀！
各位大仙，有没有好的算法呀！
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