CodeForces--606A --Magic Spheres(模拟水题)
来源:互联网 发布:java发展方向什么h5 编辑:程序博客网 时间:2024/05/18 05:13
Description
Carl is a beginner magician. He has a blue,b violet and c orange magic spheres. In one move he can transform two spheresof the same color into one sphere of any other color. To make a spell that has never been seen before, he needs at leastx blue, y violet andz orange spheres. Can he get them (possible, in multiple actions)?
Input
The first line of the input contains three integers a,b and c (0 ≤ a, b, c ≤ 1 000 000) — the number of blue, violet and orange spheres that are in the magician's disposal.
The second line of the input contains three integers, x,y and z (0 ≤ x, y, z ≤ 1 000 000) — the number of blue, violet and orange spheres that he needs to get.
Output
If the wizard is able to obtain the required numbers of spheres, print "Yes". Otherwise, print "No".
Sample Input
4 4 02 1 2
Yes
5 6 12 7 2
No
3 3 32 2 2
Yes
Sample Output
Hint
In the first sample the wizard has 4 blue and 4 violet spheres. In his first action he can turn two blue spheres into one violet one. After that he will have2 blue and 5 violet spheres. Then he turns4 violet spheres into 2 orange spheres and he ends up with2 blue, 1 violet and 2 orange spheres, which is exactly what he needs.
Source
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int a,b,c,x,y,z;long long ans,pre;int main(){while(scanf("%d%d%d%d%d%d",&a,&b,&c,&x,&y,&z)!=EOF){ans=pre=0;int p,q,r;p=q=r=0;if(a-x>=0) p=0,pre+=(a-x)/2;else p=a-x;if(b-y>=0) q=0,pre+=(b-y)/2;else q=b-y;if(c-z>=0) r=0,pre+=(c-z)/2;else r=c-z;//printf("%d\n",pre);//printf("%d %d %d\n",p,q,r);if(pre+p+q+r>=0) printf("Yes\n");else printf("No\n");}return 0;}
- CodeForces--606A --Magic Spheres(模拟水题)
- CodeForces 606A-A. Magic Spheres【模拟】
- 【CodeForces】606A - Magic Spheres(水)
- CodeForces 606 A. Magic Spheres(水~)
- CodeForces 606A. Magic Spheres
- 【CodeForces】[606A]Magic Spheres
- Codeforces 606A Magic Spheres
- 【CodeForces 606A】Magic Spheres
- Codeforces Round #335 606A - Magic Spheres
- Codeforces 606A Magic Spheres 【水题】
- CodeForces 606A Magic Spheres【水题】
- 606A Magic Spheres
- Codeforces 335A.Magic Spheres
- CodeForce--606A. Magic Spheres解题报告
- A. Magic Spheres
- Codeforces Round #335 (Div. 2) A. Magic Spheres 水题
- Codeforces Round #335 (Div. 2) A.Magic Spheres
- Codeforces Round #335 (Div. 2) A. Magic Spheres
- Linux下mv命令的用法
- 全排列算法的递归与非递归实现
- LeetCode 7.Reverse digits of an integer.
- bitmap格式分析
- hdoj5430Reflect【欧拉函数】
- CodeForces--606A --Magic Spheres(模拟水题)
- LeetCode 9.Palindrome Number
- 好书推荐之Java Web整合开发王者归来
- 提高篇 第16-19课后---项目3-4
- git版本库常用命令汇总
- Oracle基础-JOIN查询(DML)
- 机器学习(八):AdaBoost算法与实现
- ubuntu常用命令(笔记)
- C/C++ 底层的一些记录心得