1459C - Row GCD - CodeForces Solution

#include<bits/stdc++.h>
using namespace std;

#define ll long long
#define all(v) v.begin(),v.end()

void solve(ll cs) {
    ll n, m;
    cin >> n >> m;

    ll arr1[n+1], arr2[m+1];

    for(ll i=1; i<=n; i++) cin >> arr1[i];
    for(ll i=1; i<=m; i++) cin >> arr2[i];

    sort(arr1+1, arr1+n+1);

    ll gc1=0;
    for(ll i=2; i<=n; i++)
        gc1 = __gcd(gc1, arr1[i]-arr1[1]);

    for(ll i=1; i<=m; i++)
        cout << __gcd(gc1, arr1[1]+arr2[i]) << " ";
    cout << endl;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);

    ll t=1, cs=1;
    //cin>>t;
    while(t--) {
        solve(cs++);
    }

    return 0;
}