D - Meeting Bahosain

Problem - D - Codeforces

题目大意

给你两个数组a,b使a数组里的每个元素对b数组里的任意元素进行加减，结果替换到a数组，最终使得a数组中所有元素的值相等

#include <algorithm>
#include <cstring>
#include <iostream>
#define dbg(x) cout << #x << '=' << x << endl
#define FA ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define INF 0x3f3f3f3f
using namespace std;
const int N = 1e6 + 10, M = 1e3 + 10, mod = 1e9 + 7;
const double eps = 1e-8;
typedef long long LL;
typedef pair<int, int> PII;

void solve() {
    int n, k;
    cin >> n >> k;
    if (n == 1) {
        puts("Yes");
        return;
    }
    int p, q;
    for (int i = 0; i < n; i++) { //求出a中所有元素的最大公因数
        int x;
        cin >> x;
        if (i == 0)
            p = x;
        else
            p = __gcd(p, x);
    }
    for (int i = 0; i < k; i++) {//求出b中所有元素的最大公因数
        int x;
        cin >> x;
        if (i == 0)
            q = x;
        else
            q = __gcd(q, x);
    }
    if (p % q == 0) //保证gcd(a) = k * gcd(b)即可转换
        puts("Yes");
    else
        puts("No");
}
int main() {
    int T = 1;
    FA;
    while (T--) {
        solve();
    }
    return 0;
}