QOJ.ac

QOJ

Time Limit: 2 s Memory Limit: 1024 MB Total points: 100

#23875. 最近的值

Statistics

题目描述

给定整数 $X, L, R$。在 $L$ 以上 $R$ 以下的整数中,输出与 $X$ 之差的绝对值最小的那个整数。可以证明这样的整数恰好只存在 $1$ 个。

数据范围

  • $1 \le X \le 100\,000$。
  • $1 \le L \le R \le 100\,000$。

输入格式

输入从标准输入按以下格式给出:

X L R

输出格式

在 $L$ 以上 $R$ 以下的整数中,输出与 $X$ 之差的绝对值最小的那个整数。

样例 1

输入

8 3 6

输出

6

在 $3, 4, 5, 6$ 中,与 $8$ 之差的绝对值最小的是 $6$。因此输出 $6$。

样例 2

输入

7 3 10

输出

7

在 $3, 4, 5, 6, 7, 8, 9, 10$ 中,与 $7$ 之差的绝对值最小的是 $7$。因此输出 $7$。

样例 3

输入

8 10 10

输出

10

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0
No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

  1. This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
  2. Do not submit duplicated issues.
  3. Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.