Скачать или смотреть Newton Loves Different Cities |question of the day by newton school | 30/11/2022

Newton Loves Different Cities |question of the day by newton school | 30/11/2022

Problem Statement
There are N distinct cities C1, C2,. . CN on a number line and Newton is currently in city X.

Now he wants to travel to all other cities.

So he wants to choose an integer S such that he can visit all the cities starting from city X using 2 operations:
1) Subtract S from the current city number and go to the resultant city.
2) Add S to the current city number and go to the resultant city.

Find the maximum S such that newton can visit all the N cities.

(Note: He may visit other cities (not in the N cities list) as well in the process to visit all N cities)

Input

The first line of the input consists of 2 integers N and X
The next line contains N different integers C0, C1,. . CN

Output

Find the maximum S

Your Queries

newton school
newton school questions
newton school daily problems
newton school assignments
newton school assignment solutions
newton school daily problems solution
newton school question of the day
question of the day newton loves different cities
newton loves different cities
newton loves different cities problem
newton loves different cities problem solution
newton loves different cities problem solution
newton loves different cities question
newton loves different cities question answer
newton loves different cities newton school
newton school problems

#questionoftheday #coding #newtonschool