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)?
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.
If the wizard is able to obtain the required numbers of spheres, print "Yes". Otherwise, print "No".
4 4 0 2 1 2
Yes
5 6 1 2 7 2
No
3 3 3 2 2 2
Yes
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.
WA代码1:http://paste.ubuntu.com/23803568/
AC代码网址:http://paste.ubuntu.com/23808323/
题解:第一次的WA原因:分类过于复杂,导致必然有我没有考虑到的特殊情况。WA on test 60;
本题大概思路:有超出的,才能去补那些缺少的。那么如AC代码中所写,若超出,则超出部分除2,再加到一起作为sum1,若不足,则直接加到一起作为sum2,如果多出部分不足以弥补不足部分,则不可能。