'commit'

GESP/Level5/GESP202506/T2.cpp

@@ -0,0 +1,27 @@
+#include <algorithm>
+#include <cstdio>
+
+using namespace std;
+const int N = 1e5 + 5;
+int n, q, a[N], g;
+
+int gcd(int a, int b) {
+  if (a == 0 || b == 0)
+    return a + b;
+  return gcd(b, a % b);
+}
+
+int main() {
+  scanf("%d%d", &n, &q);
+  for (int i = 1; i <= n; i++)
+    scanf("%d", &a[i]);
+  sort(a + 1, a + n + 1);
+  for (int i = 2; i <= n; i++)
+    g = gcd(g, a[i] - a[i - 1]);
+  for (int i = 1; i <= q; i++) {
+    int x;
+    scanf("%d", &x);
+    printf("%d\n", gcd(g, a[1] + x));
+  }
+  return 0;
+}