AtCoder Beginner Contest 135
翻译中…
Problem Statement
翻译中…
We have two distinct integers $A$ and $B$.
翻译中…
Print the integer $K$ such that $|A - K| = |B - K|$.
翻译中…
If such an integer does not exist, print IMPOSSIBLE instead.
翻译中…
Constraints
翻译中…
- All values in input are integers.
$0 \leq A,\ B \leq 10^9$$A$and$B$are distinct.
翻译中…
Input
翻译中…
Input is given from Standard Input in the following format:
翻译中…
A B
翻译中…
Output
翻译中…
Print the integer $K$ satisfying the condition.
翻译中…
If such an integer does not exist, print IMPOSSIBLE instead.
翻译中…
样例
Input #1
2 16
Output #1
9
$|2 - 9| = 7$ and $|16 - 9| = 7$, so $9$ satisfies the condition.
Input #2
0 3
Output #2
IMPOSSIBLE
No integer satisfies the condition.
Input #3
998244353 99824435
Output #3
549034394
题目信息
题面与样例版权归 AtCoder 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。