java | 裴蜀定理模版

import java.util.Scanner;

public class 裴蜀定理 {
    public static int gcd(int x, int y) {
        return y != 0 ? gcd(y, x % y) : x;
    }
    public static void main(String[] args) {
        int n;
        Scanner in = new Scanner(System.in);
        n = in.nextInt();
        int ans = 0;
        for (int i = 0; i < n; i += 1) {
            int temp = in.nextInt();
            if (temp < 0) {
                temp = -temp;
            }
            ans = gcd(ans, temp);
        }
        System.out.print(ans);
    }
}

注意gcd的写法