Welcome![Sign In][Sign Up]
Location:
Downloads SourceCode Windows Develop
Title: lianxi Download
 Description: Experiment 3 silver coins Problem description and purpose of the experiment: the n pieces of silver, there is a failure, rejected silver coins than qualified to light. Active balance scale silver coins, silver coins failed to identify, and in the worst case the number of silver coins weighing at least. Input a number line. Each row contains an integer n, indicating the number of coins, n < 100000. When n = 0, which means that the input. Greater than 0, the output of the input integer n, the output line 2. The first line output the value of n, the second line on the first output of " Times:" , followed by the output scales n in the worst case the minimum number of pieces of silver. When n = 0 when you do not have to deal with this situation and results output.
 Downloaders recently: [More information of uploader 罗纳尔]
 To Search:
File list (Check if you may need any files):
 

实验四、哈夫曼编码.doc
实验二、最长公共子序列.doc
实验三、银币问题.doc
实验一、矩阵连乘问题.doc
    

CodeBus www.codebus.net