codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

1458A.md (818B)


      1 Source: https://codeforces.com/problemset/problem/1458/A
      2 
      3 A. Row GCD
      4 
      5 time limit per test
      6 
      7 2 seconds
      8 
      9 memory limit per test
     10 
     11 512 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 You are given two positive integer sequences $a_1, \ldots, a_n$ and $b_1, \ldots, b_m$. For each $j = 1, \ldots, m$ find the greatest common divisor of $a_1 + b_j, \ldots, a_n + b_j$.
     22 
     23 Input
     24 
     25 The first line contains two integers $n$ and $m$ ($1 \leq n, m \leq 2 \cdot 10^5$).
     26 
     27 The second line contains $n$ integers $a_1, \ldots, a_n$ ($1 \leq a_i \leq 10^{18})$.
     28 
     29 The third line contains $m$ integers $b_1, \ldots, b_m$ ($1 \leq b_j \leq 10^{18})$.
     30 
     31 Output
     32 
     33 Print $m$ integers. The $j$-th of them should be equal to GCD$(a_1 + b_j, \ldots, a_n + b_j)$.
     34 
     35 Example
     36 
     37 Input
     38 
     39 ```
     40 4 4
     41 1 25 121 169
     42 1 2 7 23
     43 ```
     44 
     45 Output
     46 
     47 ```
     48 2 3 8 24
     49 ```