2的N次方减一计算的说明文档(2 to the N minus one of the explanatory documents).doc

2的N次方减一计算的说明文档(2 to the N minus one of the explanatory documents).doc

  1. 1、本文档共7页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
2的N次方减一计算的说明文档(2 to the N minus one of the explanatory documents)

2的N次方减一计算的说明文档(2 to the N minus one of the explanatory documents) Solving 2 times N minus one: 2**N-1 results (N3000) thinking Author: Feng Libin unit: Department of information technology, 02 North Campus of Xichang College. Computer science and technology I. operation instructions: 1.Temp: indicates that the array has now stored the highest point of the result, initially making it 0 (the array subscript starts at 0) 2. defines a large enough array, where I define a[10000], and first make it 0 The number of 3. external loops is determined by the desired N, i.e., (N-1) sub - outer loops 4. sets the carry flag JW, which is initially converted to 0, with 1 at carry time 5. places the results in the corresponding bits of the array in turn Two. Analysis Start with examples: The result of setting 2**n-1 is R, then the result of 2** (n+1) -1 is 2*R+1, such as 2**5-1=31,2**6-1=2*31+1=63,2**7-1=2*63+1=127, etc. So we can use this idea to calculate the result However, since the number is large, it has exceeded the maximum number of computers that can be expressed, so it can not be equated with the general calculation, otherwise it will not be able to calculate the results Here, you can use the array method to achieve, the specific ideas are as follows: 2**1-1: 1 is placed in a[0] 2**2-1: 3 is placed in a[0] 2**3-1: 7 is placed in a[0] 2**4-1: 151 is placed in a[1], and 5 in a[0] 2**5-1: 313 is placed in a[1], and 1 in a[0] 2**6-1: 636 is placed in a[1], and 3 in a[0] 2**7-1: 1271 is placed in a[2], 2 in a[1], and 7 in a[0] ...... We can see from such a law, is that every time when N increases when used to 2 multiplied by the one above results and is now a result, so we can use such a way to achieve, but here we will put it in an array to realize the only way. Can be calculated when N great results, the maximum number of no computer can represent the requirements, due to the use of an array to save the results, so here can results only with the computers memory, so in theory,

文档评论(0)

f8r9t5c + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

版权声明书
用户编号:8000054077000003

1亿VIP精品文档

相关文档