Problems Description
<p class="p0"> </p> <p class="p0"> </p> <p class="p0"> 可怜的小明,他的住的小区只有一items电梯,大家都知problems,只要是有人按得号,电梯都会停,每到一站停止5seconds,往上走,走一层需要<span>6</span><span>seconds,往下走一层需要</span><span>4</span><span>seconds,</span><span>。我们认为每一次电梯的起始点都在Page 0层。</span> </p> <p class="p0"> 对于给出的电梯的层数,你要算出需要的时间。 </p> <p class="p0"> <br /> </p> <p class="p0"> <br /> </p> <p class="p0"> </p> <p class="p0"> </p> <p class="p0"> </p>
Input格式
<p class="p0"> <br /> </p> <p class="p0"> 那里有大量的测试数据<span>N</span><span>,随后有</span><span>N</span><span>items整数,所有的整数都不超过</span><span>100</span><span>,当</span><span>N</span><span>等于</span><span>0</span><span>的时候,程序结束。</span> </p> <p class="p0"> <br /> </p> <p class="p0"> <br /> </p> <p class="p0"> </p> <p class="p0"> </p> <p class="p0"> </p> <p class="p0"> </p>
Output格式
<p class="p0"> </p> <p class="p0"> <span style="line-height:1.5;">输出每一组所需要的时间;</span> </p> <p class="p0"> <br /> </p> <p class="p0"> </p> <p class="p0"> </p> <p class="p0"> </p> <p class="p0"> </p>
Sample
Sample Input 1
1 2
3 2 3 1
0
Sample Output 1
17
41
Submit Code
请先Login后Submit
🤖 AI 解题助手
OpenRouter
就绪