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

Re:如何证明，最多只要二类数字就可以了？

Posted by liuyi1985 at 2006-09-07 19:39:09 on Problem 2283
In Reply To:Re:如何证明，最多只要二类数字就可以了？ Posted by:henryy at 2006-06-09 15:58:51 
input: n
choose n+1 numbers such as A, AA, AAA,……. then, there must be two which have the same residues divided by n, assuming them to be X, Y(X is the bigger). Now X minus Y gets the answer.
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