题解 | 小红的gcd
小红的gcd
https://www.nowcoder.com/practice/5500a375098947c482b2c4787057cb13
#include <iostream>
#include<vector>
#define ll long long
using namespace std;
ll gcd(ll a,ll b){
ll t;
while(a%b!=0){
t=b;
b=a%b;
a=t;
}
return b;
}
int main() {
ll n,min=1e9;
cin>>n;
vector<ll>a(n);
for(ll i=0;i<n;i++){
cin>>a[i];
if(min>a[i])min=a[i];
if(a[i]%min!=0){
min=gcd(min,a[i]);
}
}
cout<<n*min;
}
查看7道真题和解析