1
1
mirror of https://github.com/theoludwig/programming-challenges.git synced 2024-12-08 00:45:29 +01:00
programming-challenges/challenges/find-closest-number
2023-01-04 18:45:30 +01:00
..
solutions feat(solutions): add find-closest-number/rust/function 2023-01-04 18:45:30 +01:00
test feat(challenges): add find-closest-number 2022-05-01 19:05:41 +02:00
README.md feat(challenges): add find-closest-number 2022-05-01 19:05:41 +02:00

find-closest-number

Created by @Divlo on 1 May 2022.

Instructions

Given an array of n integers, find the closest value to the given number (given_number).

Input

  • Line 1: An integer given_number for the number to find the closest value to
  • Line 2: An integer n for the length of the list of integers
  • n next lines: the integers

Output

The closest value in the array to the given number.

Examples

See the test folder for examples of input/output.

Example 1

Input

3
6
1
2
3
4
5
6

Output

3

Explanation: The given number is 3 and 3 is in the array, so the closest value is 3.

Example 2

Input

0
14
7
-10
13
8
4
-7
-12
-3
3
-9
6
-1
-6
7

Output

-1