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

设k从r2-1到r1+1递减变化,将k化为b1进制,结果m,再将m当作b2进制化为10进制,结果为n,若n能被k整除,则说明k是所求最大整数,否则重复这个过程,直到结束

Posted by szh992 at 2006-10-04 08:24:14 on Problem 3027


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