Drazil and Date
来源:互联网 发布:琴行软件 编辑:程序博客网 时间:2024/05/16 00:55
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?
You are given three integers a, b, and s ( - 109 ≤ a, b ≤ 109, 1 ≤ s ≤ 2·109) in a single line.
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".
5 5 11
No
10 15 25
Yes
0 5 1
No
0 0 2
Yes
In fourth sample case one possible route is: .
已知:从0,0点到n,m点走过了num步,期间可以任意方向地走,求有没有可能走到。
因为可以任意方向的走,所以会有很多种情况,但是可以注意到,两点之间有一个最短的路线,那就是n+m的和,剩下的步数,无论有多少,都要能够整除2,因为有走过去的道路,就要有走回来的道路,而且给定的步数一定要大于等于最小的步数才行。
注意:n,m的值有可能是负数,所以在计算最短步数的时候一定要换算成正整数。
#include <iostream>#include <stdio.h>#include <string.h>#include <algorithm>using namespace std;int main(){ __int64 n,m,i,j,k,num; while(~scanf("%I64d%I64d%I64d",&n,&m,&num)) { if(n < 0) n = -n; if(m < 0) m = -m; k = n + m; if(num < k) { printf("No\n"); } else { i = num - k; if(i%2==0) printf("Yes\n"); else printf("No\n"); } } return 0;}
- A. Drazil and Date
- A. Drazil and Date
- Drazil and Date
- A. Drazil and Date
- A. Drazil and Date
- A. Drazil and Date
- Drazil and Date(515A)
- CodeForces - 515A Drazil and Date
- coderforce 515A Drazil and Date
- Codeforces Round #292 (Div. 2) -- A. Drazil and Date
- Codeforces Round #292 (Div. 2) -- A. Drazil and Date
- C. Drazil and Factorial
- Drazil and Factoria
- C. Drazil and Factorial
- C. Drazil and Factorial
- 515C. Drazil and Factorial
- 【CodeForces】C. Drazil and Factorial
- CF_292_D_ Drazil and Tiles_贪心、dfs
- 代码实现9宫格布局2
- Web安全相关收集
- Xor Sum(字典树加贪心)
- [c++]动态分配空间(Fibonacci数列)
- 十二星座图片缩放,夜间模式切换
- Drazil and Date
- ndk知识
- libcurl的API详解
- 如何让Android下的hint多行时EditText焦点光标默认在第一行
- View对Touch事件的处理
- IOS调用系统联系人界面获取联系人信息
- (8)链表 《java数据结构与算法》一书第五章读书笔记。
- MvcPager分页控件的使用2
- hduoj3783(ZOJ)