【模板】裴蜀定理

题目链接

#include<bits/stdc++.h>
using namespace std;

int gcd(int x, int y)
{
	if(y == 0)
		return x;
	else
		return gcd(y, x % y);
}

int main()
{
	int n, x;
	cin >> n;
	int ans = 0;
	for(int i = 1; i <= n; i++){
		cin >> x;
		ans = gcd(ans, abs(x));
	}
	cout << ans << endl;
	return 0;
}