CF1472A.Cards for Friends

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

For the New Year, Polycarp decided to send postcards to all his nn friends. He wants to make postcards with his own hands. For this purpose, he has a sheet of paper of size w×hw \times h , which can be cut into pieces.

Polycarp can cut any sheet of paper w×hw \times h that he has in only two cases:

  • If ww is even, then he can cut the sheet in half and get two sheets of size w2×h\frac{w}{2} \times h ;
  • If hh is even, then he can cut the sheet in half and get two sheets of size w×h2w \times \frac{h}{2} ;

If ww and hh are even at the same time, then Polycarp can cut the sheet according to any of the rules above.

After cutting a sheet of paper, the total number of sheets of paper is increased by 11 .

Help Polycarp to find out if he can cut his sheet of size w×hw \times h at into nn or more pieces, using only the rules described above.

输入格式

The first line contains one integer tt ( 1t1041 \le t \le 10^4 ) — the number of test cases. Then tt test cases follow.

Each test case consists of one line containing three integers ww , hh , nn ( 1w,h104,1n1091 \le w, h \le 10^4, 1 \le n \le 10^9 ) — the width and height of the sheet Polycarp has and the number of friends he needs to send a postcard to.

输出格式

For each test case, output on a separate line:

  • "YES", if it is possible to cut a sheet of size w×hw \times h into at least nn pieces;
  • "NO" otherwise.

You can output "YES" and "NO" in any case (for example, the strings yEs, yes, Yes and YES will be recognized as positive).

输入输出样例

  • 输入#1

    5
    2 2 3
    3 3 2
    5 10 2
    11 13 1
    1 4 4

    输出#1

    YES
    NO
    YES
    YES
    YES

说明/提示

In the first test case, you can first cut the 2×22 \times 2 sheet into two 2×12 \times 1 sheets, and then cut each of them into two more sheets. As a result, we get four sheets 1×11 \times 1 . We can choose any three of them and send them to our friends.

In the second test case, a 3×33 \times 3 sheet cannot be cut, so it is impossible to get two sheets.

In the third test case, you can cut a 5×105 \times 10 sheet into two 5×55 \times 5 sheets.

In the fourth test case, there is no need to cut the sheet, since we only need one sheet.

In the fifth test case, you can first cut the 1×41 \times 4 sheet into two 1×21 \times 2 sheets, and then cut each of them into two more sheets. As a result, we get four sheets 1×11 \times 1 .

首页