十个精彩智力题(Ten wonderful puzzles).docVIP

十个精彩智力题(Ten wonderful puzzles).doc

  1. 1、本文档共7页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  5. 5、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  6. 6、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  7. 7、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  8. 8、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
十个精彩智力题(Ten wonderful puzzles)

十个精彩智力题(Ten wonderful puzzles) 1. Give a blind person 52 CARDS and tell him that there are exactly 10 CARDS on the front. The blind man was asked to divide the CARDS into two piles, so that the number of CARDS on the front of each pile was the same as the number of CARDS. What should the blind man do? Answer: divide the playing CARDS into two piles, one pile of ten, one pile of 42. Then, turn over all the CARDS in the small pile. 2. How to generate a random integer between 1 and 3 using the probability of a coin? What if this coin is unfair? The answer: if it is a fair coin, it will be thrown twice, positive and negative for 1, anyway for 2, positive for 3, and reversed to return. If the coin is unfair, pay attention to the positive and anyway probability, thus make and anyway, anyway, positive and negative, positive and negative sides respectively 1, 2, 3, the rest of the situation again. A better way to do this is to flip the coin three times, positive and negative to 1, inverse to 2, inverse anyway to be 3, the rest is back. 3. 30 COINS with no face value are arranged in a row, and a and b take turns choosing one end of the coin and taking the outside one. If you take a coin first, can you guarantee that you wont get as much money as your opponent? The answer: first, you can always take the odd number of COINS or even the number of COINS in an even position. If you count the number of values in the odd position, the total value of the number of values in the number of positions is more or less, and then you can always take the coin in those positions. 4. There are n gas stations in a ring track, and the total amount of oil in all stations is just enough to run a lap. It is proved that one of the filling stations can always be found, which makes the car with the initial gas tank set off from here and can go back to the starting point. The answer: there is always a gas station, and only its oil is enough to run to the next gas station (otherwise, all gas stations w

您可能关注的文档

文档评论(0)

jgx3536 + 关注
实名认证
文档贡献者

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

版权声明书
用户编号:6111134150000003

1亿VIP精品文档

相关文档