2017 Multi-University Training Contest - Team 1 1001题。简单数学题。
注意:直接化简公式即可。
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
/**
* 题意:求 2^inputNum - 1 的结果有多少位?
*
* 分析:10^k <= 2^inputNum - 1 ==> 10^k < 2^inputNum
* 两边取对数得:log10(10^k) < log10(2^inputNum) ==> k < inputNum*log10(2)
*
* @author TinyDolphin
*
*/
public class Main {
public static void main(String[] args) throws IOException {
StreamTokenizer in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
int inputNum;
int count = 0;
while (in.nextToken()!=StreamTokenizer.TT_EOF) {
inputNum = (int) in.nval;
out.print("Case #" + (++count) + ": ");
// 若使用 (int) 强制转换,会丢失一部分信息.
// 所以应该先生成一个 double 的外覆型 Double,再用 Double 的 intValue() 得到 int
out.println(new Double(inputNum * Math.log10(2)).intValue());
}
out.flush();
}
}