-
Notifications
You must be signed in to change notification settings - Fork 1
/
1472A - Cards for Friends.cpp
42 lines (40 loc) · 1.16 KB
/
1472A - Cards for Friends.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
/** ========================================**
** @Author: Kareem Taha Abdelfatah
** @Category: Codeforces problems solutions
/** ========================================**/
#include<bits/stdc++.h>
#include<iterator>
using namespace std;
#define IO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define endll "\n"
#define ll long long
#define fr(i, n) for(ll i = 0; i < n; i++)
#define fr1(i, n) for(ll i = 1; i <= n; i++)
#define asort(a) sort(a + 1, a + n + 1)
#define dsort(a) sort(a + 1, a + n + 1, greater<int>())
const long long N = 2e5 + 5, MOD = 1e9 + 7, oo = 1e18;
const double PI = 3.14;
const double Prox = 1e-7;
map<ll, ll>mp;
ll a[N], b[N];
int main()
{
IO
ll Tc; cin >> Tc;
while(Tc--){
ll w, h, n, ans = 1, i = 1; cin >> w >> h >> n;
while(w % 2 == 0){
w = w / 2;
ans += i;
i = i + i;
}
while(h % 2 == 0){
h = h / 2;
ans += i;
i = i + i;
}
if(ans >= n) cout << "YES" << endll;
else cout << "NO" << endll;
}
return 0;
}