Cards for Friends

A. Cards for Friends
time limit per test 1 second
memory limit per test 256 megabytes
input standard input
output standard output
For the New Year, Polycarp decided to send postcards to all his n friends. He wants to make postcards with his own hands. For this purpose, he has a sheet of paper of size w×h, which can be cut into pieces.

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

If w is even, then he can cut the sheet in half and get two sheets of size w2×h;
If h is even, then he can cut the sheet in half and get two sheets of size w×h2;
If w and h 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 1.

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

Input
The first line contains one integer t (1≤t≤104) — the number of test cases. Then t test cases follow.

Each test case consists of one line containing three integers w, h, n (1≤w,h≤104,1≤n≤109) — the width and height of the sheet Polycarp has and the number of friends he needs to send a postcard to.

Output
For each test case, output on a separate line:

“YES”, if it is possible to cut a sheet of size w×h into at least n 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).

Example
input
5
2 2 3
3 3 2
5 10 2
11 13 1
1 4 4
output
YES
NO
YES
YES
YES
Note
In the first test case, you can first cut the 2×2 sheet into two 2×1 sheets, and then cut each of them into two more sheets. As a result, we get four sheets 1×1. We can choose any three of them and send them to our friends.

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

In the third test case, you can cut a 5×10 sheet into two 5×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×4 sheet into two 1×2 sheets, and then cut each of them into two more sheets. As a result, we get four sheets 1×1.

My Answer Code:

/*
    Author:Albert Tesla Wizard
    Time:2021/1/8 22:20
 */
import java.util.*;
public class Solution
{
    public static void main(String[] args)
    {
        int t;
        Scanner cin=new Scanner(System.in);
        t=cin.nextInt();
        while(t>0)
        {
            t--;
            int w,h,n,cnt=1;
            w=cin.nextInt();
            h=cin.nextInt();
            n=cin.nextInt();
            for(;w%2==0&&w!=0;w/=2)cnt*=2;
            for(;h%2==0&&h!=0;h/=2)cnt*=2;
            if(cnt>=n)System.out.println("YES");
            else System.out.println("NO");
        }
    }
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值