10个精彩智力问题（10 wonderful intellectual problems）.docVIP

下载本文档

2
0
约6.4千字
约 5页
2017-08-21 发布于河南
举报
版权申诉

10个精彩智力问题（10 wonderful intellectual problems）.doc

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

10个精彩智力问题（10 wonderful intellectual problems）

10个精彩智力问题（10 wonderful intellectual problems） 1. give a blind man 52 cards and tell him that there are 10 cards inside which face up. The blind man asked to put the cards into two piles, a kind of multi count so that each stack of cards in face up card. What should a blind man do? Answer: divide the playing cards into two piles, 10 pieces in one pile and 42 in a pile. Then turn over all the cards in the small pile. 2. how do you generate a random integer between 1 and 3 with a coin like probability? What if the coin is unfair? Answer: if it is a fair coin, throw it two times, positive and negative is 1, anyway is 2, right is 3, anti again. If it is not fair coin, pay attention to positive and anyway probability, so and anyway, anyway, positive and negative and positive and negative were 1, 2, 3, the rest of the situation. Another better way is to throw three coins, reverse to 1, counter to 2, inverse anyway 3, the rest of the situation comes again. 3.30 different coins are placed in a row, and a and B two take turns to select one end of the row of coins and take the outermost coin. If you take a coin, ensuring that the money will not be less than the opponent? Answer: preemptor can let you always get the odd positions of coins or always take even position on the coin. Count is the sum value of the sum value of odd positions or even more on the position, and always take that position on the coin can be. 4. there are N gas stations on a ring track, and the total amount of gas at all stations is just enough for the car to run around. Proof that one of the gas stations can always be found, so that when the initial fuel tank is empty, the car starts here and goes back smoothly to the starting point. Answer: there is always a gas station, and only its oil is enough to run to the next gas station (otherwise, all the gas stations will not be full enough). Move all the oil from the next gas station to the gas station ahead of time and ignore the petrol station which has been