Problems Description
<p class="MsoNormal"> <span style="font-size:small;"><span style="font-family:宋体;">给你一items非零整数,让你求这items数的</span><span><span style="font-family:'Times New Roman';">n</span></span><span style="font-family:宋体;">次方,每次相乘的结果可以在后面使用,求至少需要多少次乘。如</span><span><span style="font-family:'Times New Roman';">2<sup>4</sup></span></span><span style="font-family:宋体;">:</span><span><span style="font-family:'Times New Roman';">2*2=2<sup>2</sup></span></span><span style="font-family:宋体;">(Page 一次乘),</span><span><span style="font-family:'Times New Roman';">2<sup>2</sup>*2<sup>2</sup>=2<sup>4</sup></span></span><span style="font-family:宋体;">(Page 二次乘),所以最少Total</span><span><span style="font-family:'Times New Roman';">2</span></span><span style="font-family:宋体;">次;</span></span> </p>
Input格式
Page 一行m表示有m(1<=m<=100)组测试数据;<br /> 每一组测试数据有一整数n(0<n<=10000);
Output格式
输出每组测试数据所需次数s;
Sample
Sample Input 1
4
2
3
4
1000
Sample Output 1
1
2
2
14
Submit Code
请先Login后Submit
🤖 AI 解题助手
OpenRouter
就绪