[C++] 백준 문제풀이 (Number Theory) 17087번 숨바꼭질 6

 

 

https://www.acmicpc.net/problem/17087

17087번: 숨바꼭질 6

 

 

#include <bits/stdc++.h>
// [C++] 백준 문제풀이 (Number Theory)


int gcd(int a, int b){
	if (b == 0) return a;
	return gcd(b, a % b);
}


int main(int argc, char *argv[])
{
	std::ios_base::sync_with_stdio(false);
	std::cin.tie(nullptr);

	int n, s, a;
	std::cin >> n >> s;
	std::cin >> a;
	int ret = std::abs(s - a);

	for (int i = 1; i < n; ++i){
		std::cin >> a;
		ret = gcd(ret, std::abs(s - a));
	}
	std::cout << ret << "\n";
	return 0;
}