AtCoder Beginner Contest 114
翻译中…
Problem Statement
翻译中…
There is a string $S$ consisting of digits 1, 2, $...$, 9. Lunlun, the Dachshund, will take out three consecutive digits from $S$, treat them as a single integer $X$ and bring it to her master. (She cannot rearrange the digits.)
翻译中…
The master's favorite number is $753$. The closer to this number, the better. What is the minimum possible (absolute) difference between $X$ and $753$?
翻译中…
Constraints
翻译中…
$S$is a string of length between$4$and$10$(inclusive).- Each character in
$S$is1,2,$...$, or9.
翻译中…
Input
翻译中…
Input is given from Standard Input in the following format:
翻译中…
S翻译中…
Output
翻译中…
Print the minimum possible difference between $X$ and $753$.
翻译中…
样例
Input #1
1234567876
Output #1
34
Taking out the seventh to ninth characters results in $X = 787$, and the difference between this and $753$ is $787 - 753 = 34$. The difference cannot be made smaller, no matter where $X$ is taken from.
Note that the digits cannot be rearranged. For example, taking out `567` and rearranging it to `765` is not allowed.
We cannot take out three digits that are not consecutive from $S$, either. For example, taking out the seventh digit `7`, the ninth digit `7` and the tenth digit `6` to obtain `776` is not allowed.
Input #2
35753
Output #2
0
If `753` itself can be taken out, the answer is $0$.
Input #3
1111111111
Output #3
642
No matter where $X$ is taken from, $X = 111$, with the difference $753 - 111 = 642$.
题目信息
题面与样例版权归 AtCoder 及出题人所有；中文翻译由 AI 生成（CI 管线），如有出入请以原文为准。