Magic Spheres--Codeforce
来源:互联网 发布:幻萌网络知乎 编辑:程序博客网 时间:2024/05/16 11:00
Carl is a beginner magician. He has a blue, b violet and c orange magic spheres. In one move he can transform two spheres of the same color into one sphere of any other color. To make a spell that has never been seen before, he needs at least x blue, y violet and z 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".
Example
Input
4 4 02 1 2OutputYesInput5 6 12 7 2OutputNoInput3 3 32 2 2OutputYes
Note
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 have 2 blue and 5 violet spheres. Then he turns 4 violet spheres into 2 orange spheres and he ends up with 2 blue, 1 violet and 2 orange spheres, which is exactly what he needs.
题意:
给你 黄篮紫三种颜色的东西a b c个 每两个相同颜色的可兑换成一个其他颜色的。 给出三个数字xyz,问你能否使每种颜色的球大于搜给出的数字。
这题蛋碎了一地。 题意没看清,以为是要使abc恰好等于xyz磨蹭了一个多小时。orz。
解题思路:
暴力模拟。
#include<iostream>#include<cstdio>#include<string.h>#include<string>#include<queue>#include<algorithm>#include<vector>using namespace std;int dp[100005][15];int main(){ int a,b,c; int na,nb,nc; while(scanf("%d%d%d",&a,&b,&c)!=EOF) { int havd=0,need=0; scanf("%d%d%d",&na,&nb,&nc); a-=na; b-=nb; c-=nc; a>0?havd+=a/2:need+=a; b>0?havd+=b/2:need+=b; c>0?havd+=c/2:need+=c; //cout<<havd<<""<<need; if((havd+need)>=0) puts("YES\n"); else puts("NO\n"); } return 0;}
0 0
- Magic Spheres--Codeforce
- CodeForce--606A. Magic Spheres解题报告
- Magic Spheres
- Magic Spheres
- Magic Spheres
- Magic Spheres
- Magic Spheres
- Magic Spheres
- A. Magic Spheres
- 606A Magic Spheres
- Codeforces 335A.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-A. Magic Spheres【模拟】
- 巴特沃斯低通滤波
- FIR低通滤波
- 移动均值滤波
- 中值滤波
- 自适应滤波
- Magic Spheres--Codeforce
- 小波滤波
- 【LeetCode】Number Complement 解题报告
- hdu1698 Just a Hook
- React Native遇见的几个坑
- js prototype 应该算是解释的最比较清晰的
- 2016书单总结--Java网络编程
- cxf生成的webService,注解/注释自动生成的webService
- 前序2 前端要学习的基础