You are given two positive integer groupings a1,… ,an and b1,… ,bm. For each j=1,… ,m track down the best normal divisor of a1+bj,… ,an+bj.  Input :The primary line contains two integers n and m (1≤n,m≤2⋅105).  The subsequent line contains n integers a1,… ,an (1≤ai≤1018). The third line contains m integers b1,… ,bm (1≤bj≤1018).  Output :Print m

Q: Let A = {b, h, s}. Draw A(r) for each regular expression r below. (iii) r3 = (sh)*

A: A regular expression is a pattern that describes a set of strings that matches the pattern.

Q: Given a boolean expression consisting of the symbols 0 (false), 1 (true), & (AND), I (OR), and /…

A: As in other recursive problems, the key to this problem is to figure out the relationship between a…

Q: Note: Please Answer in C++ only Chef and his little brother are playing with sticks. They have total…

A: The answer is given in the below step

Q: [Unbalanced kod] Given a set of n weights {w₁,..., w} and a rod of length n - 1 inches, we can…

A: Greedy Algorithm A greedy algorithm is an algorithmic approach that follows the heuristic of making…

Q: [In C language] The concept of a "drunkard's walk" involves an individual who starts walking…

A: In this question we have to write C program to simulate a "drunkard's walk," a conceptual model…

Q: Write a fraction calculator program. Your program should check for the division by 0, have and use…

A: According to the information given:- we have to create fractional calculator for that we will take…

Q: Note: Please Answer in C++ only Chef and his little brother are playing with sticks. They have total…

A: Your C++ program is given below as you required with an output.