Bob is a sorcerer. He lives in a cuboid room which has a length of A, a width of B and a height of C, so we represent it as A * B * C. One day, he finds that his room is filled with unknown dark energy. Bob wants to neutralize all the dark energy in his room with his light magic. He can summon a 1 * 1 * 2 cuboid at a time to neutralize dark energy. But the cuboid must be totally in dark energy to take effect. Can you foresee whether Bob can save his room or not?
Input
Input has T test cases. T≤100
For each line, there are three integers A,B,C.
1≤A,B,C≤100
Output
For each test case, if Bob can save his room, print"Yes", otherwise print"No".
样例输入
1 1 2
1 1 4
1 1 1
样例输出
Yes
Yes
No
这题的大概意思是给出房间的长宽高,然后一次只能净化1* 1* 2=2体积的空间,看看能不能刚好净化完。
思路:也就是看一个空间能不能被2整除。附上代码。
#include<iostream>
using namespace std;
int main()
{
int a,b,c,v,i;
while((cin>>a)!=NULL)
{
cin>>b>>c;
v=a*b*c;//计算体积
if(v%2==0)//2是1*1*2
{
cout<<"Yes"<<endl;
}
else
{
cout<<"No"<<endl;
}
}
return 0;
}