A. Drazil and Date

A. Drazil and Date

time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
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?

Input
You are given three integers a, b, and s ( - 109 ≤ a, b ≤ 109, 1 ≤ s ≤ 2·109) in a single line.

Output
If you think Drazil made a mistake and it is impossible to take exactly s steps and get from his home to Varda’s home, print “No” (without quotes).

Otherwise, print “Yes”.

Examples
input
5 5 11
output
No
input
10 15 25
output
Yes
input
0 5 1
output
No
input
0 0 2
output
Yes

问题链接：A. Drazil and Date.

问题简述：

小明住在（0,0）,小李住在（a,b）。小明是一个迷路狂徒，他不但会走错路，还会路过小李家也不知道。但是，他总算是走到了。输入小李的住处(a,b)和小明一共走的路程s(ps.小明不能斜着走），判断小明所走的路程是否正确。正确则输出“Yes”，否则输出“No”。

问题分析：

明显，最短路程为a+b，且易知，小明每走错一步，就要花费另一步走回正确的道路，所以小明多走的路只能是双数。

程序说明：

AC通过的C语言程序如下：

   #include<iostream>
#include<iomanip>
using namespace std;


int main()
{
	int a, b;
	unsigned s;
	cin >> a >> b >> s;
	int n;
	if (a < 0)a = -a;
	if (b < 0)b = -b;
	n = a + b;
	if (s == n || s>n&&(s - n) % 2 == 0)cout << "Yes";
	else cout << "No";
	return 0;
}