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:一种O(n)算法

Posted by darkcaller at 2010-12-12 12:44:20 on Problem 2159
In Reply To:Re:一种O(n)算法 Posted by:watergear at 2010-05-17 20:21:51 
> 
> 可以参考的思路：
> a1^2 + b1^2 = a2^2 + b2^2
> 推出
> a1 = a2, b1 = b2

1^2+7^2=5^2+5^2
所以即使结论成立a1+b1=a2+b2的条件是不能少的
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