fjnu 1501 Combination Lock

最新推荐文章于 2019-03-30 06:07:46 发布

核动力蜗牛Killua

最新推荐文章于 2019-03-30 06:07:46 发布

阅读量916

点赞数

分类专栏： ☆ACM 解题报告☆ 文章标签： numbers input iostream output integer each

本文链接：https://blog.csdn.net/killua_hzl/article/details/2283472

版权

☆ACM 解题报告☆ 专栏收录该内容

229 篇文章 6 订阅

订阅专栏

Description

Now that you're back to school for another term, you need to remember how to work the combination lock on your locker. A common design is that of the Master Brand, shown at right. The lock has a dial with 40 calibration marks numbered 0 to 39. A combination consists of 3 of these numbers; for example: 15-25-8. To open the lock, the following steps are taken:

.turn the dial clockwise 2 full turns
.stop at the first number of the combination
.turn the dial counter-clockwise 1 full turn
.continue turning counter-clockwise until the 2nd number is reached
.turn the dial clockwise again until the 3rd number is reached
.pull the shank and the lock will open.

Given the initial position of the dial and the combination for the lock, how many degrees is the dial rotated in total (clockwise plus counter-clockwise) in opening the lock?

Input

Input consists of several test cases. For each case there is a line of input containing 4 numbers between 0 and 39. The first number is the position of the dial. The next three numbers are the combination. Consecutive numbers in the combination will be distinct. A line containing 0 0 0 0 follows the last case.

Output

For each case, print a line with a single integer: the number of degrees that the dial must be turned to open the lock.

Sample Input

Sample Output

KEY：这题我一直感觉很BT，居然是表盘在转…所以想的顺时针逆时针都错了……


  
  
   
   
    
    
    
    Source:

#include
    
    <
    
    iostream
    
    >
    
    

    
    using
    
     
    
    namespace
    
     std;


    
    int
    
     count(
    
    int
    
     a,
    
    int
    
     b,
    
    int
    
     c,
    
    int
    
     d)

    
    ...
    
    {
    int sum=0;
    if(a>b)
    ...{
        sum+=(a-b)*9;
    }
    else sum+=(40-(b-a))*9;
    if(b>c)
    ...{
        sum+=(40-(b-c))*9;
    }
    else sum+=(c-b)*9;
    if(c>d)
    ...{
        sum+=(c-d)*9;
    }
    else sum+=(40-(d-c))*9;
    return sum;

}