Codeforce 515A - Drazil and Date

Posted 2020-09-30 午夜的行人

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: .

题解：记得加绝对值

 1 #include <iostream>
 2 #include <algorithm>
 3 #include <cstring>
 4 #include <cstdio>
 5 #include <vector>
 6 #include <cstdlib>
 7 #include <iomanip>
 8 #include <cmath>
 9 #include <ctime>
10 #include <map>
11 #include <set>
12 using namespace std;
13 #define lowbit(x) (x&(-x))
14 #define max(x,y) (x>y?x:y)
15 #define min(x,y) (x<y?x:y)
16 #define MAX 100000000000000000
17 #define MOD 1000000007
18 #define pi acos(-1.0)
19 #define ei exp(1)
20 #define PI 3.141592653589793238462
21 #define INF 0x3f3f3f3f3f
22 #define mem(a) (memset(a,0,sizeof(a)))
23 typedef long long ll;
24 const int N=205;
25 const int mod=1e9+7;
26 int main()
27 {
28     ll a,b,s;
29     while(cin>>a>>b>>s){
30         a=llabs(a),b=llabs(b);
31         int flag=1;
32         if(a+b>s) flag=0;
33         else {
34             if(a+b==0&&s%2==0) flag=1;
35             else if(a+b==0&&s%2==1) flag=0;
36             else {
37                 ll t=s-(a+b);
38                 if(t%2==0) flag=1;
39                 else flag=0;
40             }
41         }
42         if(flag) cout<<"Yes"<<endl;
43         else cout<<"No"<<endl;
44     }
45     return 0;
46 }

以上是关于Codeforce 515A - Drazil and Date的主要内容，如果未能解决你的问题，请参考以下文章

C. Drazil and Factorial1400 / 构造

A. Drazil and Date1000 / 思维

Codeforces 631 (Div. 2) E. Drazil Likes Heap 贪心

CF R631 div2 1330 E Drazil Likes Heap

Codeforces Round #292 (Div. 2) C. Drazil and Factorial 515C

CF516D Drazil and Morning Exercise