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

方法:knuth具体数学 的最简单情况

Posted by 369_802340 at 2013-01-11 07:07:23 on Problem 1781
用给出的n循环右移就是答案。

比如说5 - 101
结果就是 11
最高位的1放到最后面,这个用程序很容易实现。 右移之后找到最高位的的2的多少次方,减去2^xx之后再+1就好了。

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