CodeForces/ASimpleGCDProblem.cpp at main · codeAntariksh/CodeForces · GitHub

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
66
67
68
69
70
71
72
/*
AUTHOR: Antarikshya Mitra
TIME:
PROBLEM NO:- A Simple GCD Problem (Easy Version) Div2 C1
*/


#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
const int MOD = 1e9 + 7;


long long lcm(long long a, long long b) {
    return (a /__gcd(a, b))*b;
}


void solve(vector<int> &a,vector<int> &b)
{
	int n = a.size();
	vector<long long> g(n-1);
    for(int i = 0; i < n-1; i++){
        g[i] = __gcd(a[i], a[i+1]);
    }
    int ans = 0;
    for(int i = 0; i < n; i++){
        long long need;
        if(i == 0){
            need = g[0];
        }
        else if(i == n-1){
            need = g[n-2];
        }
        else{
            need = lcm(g[i-1], g[i]);
        }
        if(need > b[i]) continue;
        if(a[i] != need){
            ans++;
        }
        else{
            if(2 * need <= b[i]){
                ans++;
            }
        }
    }
    cout<<ans<<"\n";
}

int32_t main()
{
	ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
	int t=1;
	cin>>t;
	while(t--)
	{
		int n;
		cin>>n;
		vector<int> arr(n);
		vector<int> brr(n);
		for (auto &a:arr)
			cin>>a;
		for(auto &a:brr)
			cin>>a;
		solve(arr,brr);
	}
	return 0;
}