gcd（概念+例题）

模板：

例题：

例题1：https://sdnuoj.rainng.com/problem/show/1354
代码：

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define inf 0x3f3f3f3f
const int N = 100 + 7;
const int M = 1e6 + 7;

ll n, longcable[N], num;

ll gcd(ll a, ll b){
	return b == 0 ? a : gcd(b, a % b);
} 

int main(){
	std::ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n;
	for (int i = 0; i < n; ++i){
		cin >> longcable[i];
	}
	ll ans = longcable[0];
	for (int i = 0; i < n; ++i){
		ans = gcd(ans, longcable[i]);
	}
	for (int i = 0; i < n; ++i){
		num += longcable[i] / ans;
	}
	cout << ans << endl << num << endl;
	return 0;
}