原文链接：https://www.cnblogs.com/Time25/p/19804174.html

完整代码

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
#include<bits/stdc++.h>
using namespace std;
//"O campeão tem nome, e se chama Charles Oliveira!"
#define int long long
#define endl '\n'
#define ep emplace
#define pob 
#define ll long long
#define pb push_back
#define pof pop_front
#define pob pop_back
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define mod 998244353
#define MOD 1000000007
const int N=200005;

using ld = long double;
using ui = unsigned;
using ull = unsigned long long;
using i128 = __int128;

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

int Lcm(int a,int b){
    return a/gcd(a,b)*b;
}
void solve(){
    int n;cin>>n;
    vector<int>a(n),b(n),g(n-1);
    for(int i=0;i<n;i++)cin>>a[i];
    for(int i=0;i<n;i++)cin>>b[i];
    if(n<2){
        cout<<0<<endl;
        return ;
    }
    for(int i=0;i<n-1;i++){
        g[i]=gcd(a[i],a[i+1]);
    }
    int cnt=0;
    for(int i=0;i<n;i++){
        int l=0;
        if(i==0){
            l=g[0];
        }else if(i==n-1){
            l=g[n-2];
        }else{
            l=lcm(g[i-1],g[i]);
        }
        if(l<a[i])cnt++;
    }
    cout<<cnt<<endl;
}


signed main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int t=1;
    cin>>t;
    while(t--)solve();
}
// TRAINING LOG · 第 39 / 76 篇训练记录 · 成文于 2026.04.01 · 凌晨 00:06