A2019 Save the Room

一、A2019 Save the Room

本题链接：A2019 Save the Room

题目：

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

本博客给出本题截图：

AC代码

#include <iostream>using namespace std;int main()
{
    int a, b, c;while(cin >> a >> b >> c)if (a % 2 == 0 || b % 2 == 0 || c % 2 == 0 ) puts("Yes");else puts("No");return 0;
}

总结

大胆猜测，只要三边有一条边是偶数就可以满足题意