约会步数判断

Someday, Drazil wanted to go on date with Varda. Drazil and Varda live on Cartesian plane. Drazil’s home is located in point (0, 0) and Varda’s home is located in point (a, b). In each step, he can move in a unit distance in horizontal or vertical direction. In other words, from position (x, y) he can go to positions (x + 1, y), (x - 1, y), (x, y + 1) or (x, y - 1).

Unfortunately, Drazil doesn’t have sense of direction. So he randomly chooses the direction he will go to in each step. He may accidentally return back to his house during his travel. Drazil may even not notice that he has arrived to (a, b) and continue travelling.

Luckily, Drazil arrived to the position (a, b) successfully. Drazil said to Varda: “It took me exactly s steps to travel from my house to yours”. But Varda is confused about his words, she is not sure that it is possible to get from (0, 0) to (a, b) in exactly s steps. Can you find out if it is possible for Varda?
问题简述：
D要去找V，Drazil的家位于点(0，0)，Varda的家位于点(a，b)。在每一步，他可以在单位距离水平或垂直方向移动。换句话说，从位置(x，y)到位置(x+1，y)，(x-1，y)，(x，y+1)或(x，y-1)。输入a,b,s.计算看D是否能到v的家。
问题分析：
首先，确定a,b的范围，（- 10的9次方 ≤ a, b ≤ 10的9次方, 1 ≤ s ≤ 2·10的9次方)；第二，要知道有效距离为·a+b;实际距离为s，满足关系为（s-(a+b)%2=0；因为无效距离相抵消才能到目的地。
AC的C++程序为