题解 | #魔法表#

#include <iostream>
using namespace std;

int getMinRotation(int n1, int n2) {
    if(n1 == n2) return 0;
    
    if(n1 > n2) {
        // 计算两个方向的旋转角度
        int clockwise = 360 - n1 + n2;        // 顺时针
        int counterclockwise = -(n1 - n2);    // 逆时针
        
        // 选择较小的角度
        if(abs(clockwise) < abs(counterclockwise)) {
            return clockwise;
        } else if(abs(clockwise) > abs(counterclockwise)) {
            return counterclockwise;
        } else {
            return clockwise;  // 角度相等时选择顺时针
        }
    } else {
        // n1 < n2
        int clockwise = n2 - n1;              // 顺时针
        int counterclockwise = -(360 - n2 + n1); // 逆时针
        
        if(abs(clockwise) < abs(counterclockwise)) {
            return clockwise;
        } else if(abs(clockwise) > abs(counterclockwise)) {
            return counterclockwise;
        } else {
            return clockwise;  // 角度相等时选择顺时针
        }
    }
}

int main() {
    int n1, n2;
    cin >> n1 >> n2;
    cout << getMinRotation(n1, n2) << endl;
    return 0;
}

import java.util.*;

public class Main {
    static int getMinRotation(int n1, int n2) {
        if(n1 == n2) return 0;
        
        if(n1 > n2) {
            // 计算两个方向的旋转角度
            int clockwise = 360 - n1 + n2;        // 顺时针
            int counterclockwise = -(n1 - n2);    // 逆时针
            
            // 选择较小的角度
            if(Math.abs(clockwise) < Math.abs(counterclockwise)) {
                return clockwise;
            } else if(Math.abs(clockwise) > Math.abs(counterclockwise)) {
                return counterclockwise;
            } else {
                return clockwise;  // 角度相等时选择顺时针
            }
        } else {
            // n1 < n2
            int clockwise = n2 - n1;              // 顺时针
            int counterclockwise = -(360 - n2 + n1); // 逆时针
            
            if(Math.abs(clockwise) < Math.abs(counterclockwise)) {
                return clockwise;
            } else if(Math.abs(clockwise) > Math.abs(counterclockwise)) {
                return counterclockwise;
            } else {
                return clockwise;  // 角度相等时选择顺时针
            }
        }
    }
    
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n1 = sc.nextInt();
        int n2 = sc.nextInt();
        System.out.println(getMinRotation(n1, n2));
    }
}

def get_min_rotation(n1, n2):
    if n1 == n2:
        return 0
    
    if n1 > n2:
        # 计算两个方向的旋转角度
        clockwise = 360 - n1 + n2        # 顺时针
        counterclockwise = -(n1 - n2)    # 逆时针
        
        # 选择较小的角度
        if abs(clockwise) < abs(counterclockwise):
            return clockwise
        elif abs(clockwise) > abs(counterclockwise):
            return counterclockwise
        else:
            return clockwise  # 角度相等时选择顺时针
    else:
        # n1 < n2
        clockwise = n2 - n1              # 顺时针
        counterclockwise = -(360 - n2 + n1) # 逆时针
        
        if abs(clockwise) < abs(counterclockwise):
            return clockwise
        elif abs(clockwise) > abs(counterclockwise):
            return counterclockwise
        else:
            return clockwise  # 角度相等时选择顺时针

n1, n2 = map(int, input().split())
print(get_min_rotation(n1, n2))