PP1 and Competitive Programming
Easy problem for Dino
The math teacher asks Dino a very simple question: Given two different integers a and b. Find such integer k that |a - k| = |b - k|. Warning: |x| means absolute value.
Two integers a and b (
-109 ≤ a, b ≤
109, a ≠ b).
If the value of k doesn't exist, print - , otherwise print k.