E. Prefix GCD
思路:
gcd减少的过程中至少会除以2,那么gcd收敛是log级别的,暴力+贪心,每一步都找使gcd前缀最小的数即可,直到gcd达到最小(即所有数的gcd)时,剩下的部分就可以直接计算。
代码:
#include <bits/stdc++.h>
#define endl '\n'
#define int long long
#define pb push_back
#define pii pair<int,int>
const int MOD = 1e9 + 7;
const int INF = 0x3f3f3f3f;
typedef long long ll;
using namespace std;
int n, a[100005];
void solve() {
cin >> n;
int eg = 0, pg = 0; //终止gcd 和 前缀gcd
for (int i = 1; i <= n; ++i) {
cin >> a[i];
eg = gcd(eg, a[i]);
}
ll ans = 0;
for (int i = 1; i <= n; ++i) {
if (pg == eg) { //终止条件
ans += 1LL * (n - i + 1) * pg;
break;
}
int temp = INF;
for (int j = 1; j <= n; ++j) {
temp = min(temp, gcd(pg, a[j]));
}
pg = temp; //更新pgcd
ans += pg;
}
cout << ans << endl;
}
signed main() {
cin.tie(0)->ios::sync_with_stdio(0);
int T = 1;
cin >> T;
while (T--) {
solve();
}
return 0;
}