Text Reverse
Time limit 1000 ms
Memory limit 262144 kB
Source Codeforces Round #292 (Div. 2)
Tags math *1100
Editorial Announcement Tutorial

Problem Description
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

Note
In fourth sample case one possible route is: .
問題連結：
CodeForces - 515A

問題簡述：
Drazil是個糊塗鬼，說自己進行了多少步的位移到了Varda的家，Varda並不相信，希望我們證明Drazil說的話是否正確。

問題分析：
判斷奇偶性，正負號的轉換。

程式說明：
先給V家的位移加個絕對值。如果a+b>s,則D不可能在s步數內到達V家；如果位移差為0（即s-a-b=0）或者位移差為正偶數，則能在s步內到達V家。

 #include <iostream>
using namespace std;


int main()
{
	int a,b,s;
	cin >> a>>b>>s;
	if (a < 0)
		a = -a;
	if (b < 0)
		b = -b;
	if (a+b>s)
		cout << "NO" << endl;
	else if((s - a - b) == 0 | (s - a - b) % 2 == 0)
		cout << "YES" << endl;
	else cout << "NO" << endl;
	return 0;
}