A. Drazil and Date

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

圆***

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

阅读量104

点赞数

分类专栏：刷题

本文链接：https://blog.csdn.net/c_h_e_e_r_y_saber/article/details/84930364

版权

刷题专栏收录该内容

18 篇文章 0 订阅

订阅专栏

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

问题链接：[https://vjudge.net/problem/CodeForces-515A]

问题简述：一个人从（0，0）点走向另一个坐标点（x，y），输入指定坐标和这个人走的步数，问是否能够精准的以这个步数走到指定的坐标点。

问题分析：
1）从（0，0）走到另外一个坐标点（x，y）的最短距离，即|x|+|y|，所以该步数应大于或等于|x|+|y|。
2）若要以给出的步数精准的走到指定的点，则必要条件有该步数减去（|x|+|y|）的值应能够被2整除，用if语句实现条件的判定。

已AC过的代码：

#include<iostream>
#include<cmath>
using namespace std;
int main()
{
	int a, b, s, sum;
	cin >> a >> b >> s;
	sum = abs(a)+abs(b);
	
	if (s >= sum && (s - sum) % 2 == 0)
		cout << "Yes";
	else
		cout << "No";
}