A. Drazil and Date

最新推荐文章于 2021-08-31 16:58:41 发布

Kirito_Acmer

最新推荐文章于 2021-08-31 16:58:41 发布

阅读量483

点赞数

CC 4.0 BY-SA版权

分类专栏： codeforces 文章标签： codeforces

本文链接：https://blog.youkuaiyun.com/Kirito_Acmer/article/details/44976421

codeforces 专栏收录该内容

32 篇文章

订阅专栏

本文深入探讨了AI音视频处理领域中的关键技术——视频分割与语义识别，通过详细解释这些技术的工作原理、应用场景及实际应用案例，为读者提供了一次全面的技术学习之旅。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

Sample test(s)

input
5 5 11

output
No

input
10 15 25

output
Yes

input
0 5 1

output
No

input
0 0 2

output
Yes这题要注意数据很大，要用__int64,而且要注意负数，0,0的时候要特殊考虑。#include<stdio.h>
#include<math.h>
int main()
{
	__int64 n,m,i,j,k,d;
	while(scanf("%I64d%I64d%I64d",&n,&m,&k)!=EOF)
	{
		if(n==0 && m==0){
			if(k%2==0){
				printf("Yes\n");continue;
			}
			else{
				printf("No\n");continue;
			}
		}
		d=fabs(n)+fabs(m);
		if(d>k){
			printf("No\n");continue;
		}
		if(d==k){
			printf("Yes\n");continue;
		}
		if(d<k){
			if((k-(d-1))%2==1){
				printf("Yes\n");
			}
			else printf("No\n");
		}
	}
}