1
#include <cstdio>
2
#include <iostream>
3
#include <algorithm>
4
#include <cmath>
5
#include <cstring>
6
using namespace std;
7

8
int t, w, h, n;
9
int c1, c2;
10

11
int main() {
12
  cin >> t;
13
  while(t--) {
14
    cin >> w >> h >> n;
15
    c1 = 0, c2 = 0;
16
    while(!(w & 1)) w >>= 1, c1++;
17
    while(!(h & 1)) h >>= 1, c2++;
18
    // cout << c1 << " " << c1 << endl;
19
    if((1 << c1) * (1 << c2) >= n) cout << "YES" << endl;
20
    else cout << "NO" << endl;
21
  }
22
  return 0;
23
}

1
#include <cstdio>
2
#include <iostream>
3
#include <algorithm>
4
#include <cmath>
5
#include <cstring>
6
using namespace std;
7

8
int t, a[107], n;
9

10
int main() {
11
  cin >> t;
12
  while(t--) {
13
    cin >> n;
14
    int s1 = 0, s2 = 0;
15
    for(int i = 1; i <= n; i++) cin >> a[i];
16
    for(int i = 1; i <= n; i++) s1 += (a[i] == 1), s2 += (a[i] == 2);
17
    if((!(s1 & 1) && !(s2 & 1)) || (!(s1 & 1) && (s2 & 1) && s1 >= 2)) {
18
      cout << "YES" << endl;
19
    }
20
    else cout << "NO" << endl;
21
  }
22
  return 0;
23
}

1
#include <cstdio>
2
#include <iostream>
3
#include <algorithm>
4
#include <cmath>
5
#include <cstring>
6
using namespace std;
7

8
const int maxn = 2e5 + 17;
9

10
int n, t, a[maxn], s[maxn], ans;
11

12
int sv(int p) {
13
  if(p > n) return 0;
14
  if(!s[p]) s[p] = a[p] + sv(p + a[p]);
15
  return s[p];
16
}
17

18
int main() {
19
  cin >> t;
20
  while(t--) {
21
    cin >> n;
22
    for(int i = 1; i <= n; i++) cin >> a[i];
23
    for(int i = 1; i <= n; i++) s[i] = 0;
24
    ans = 0;
25
    for(int i = 1; i <= n; i++) if(!s[i]) {
26
      ans = max(ans, sv(i));
27
    }
28
    cout << ans << endl;
29
  }
30
  return 0;
31
}

1
#include <cstdio>
2
#include <iostream>
3
#include <algorithm>
4
#include <cmath>
5
#include <cstring>
6
using namespace std;
7

8
typedef long long ll;
9
const int maxn = 2e5 + 17;
10

11
bool cmp(int x, int y) {
12
  return x > y;
13
}
14

15
int n, a[maxn], t;
16
ll s[2];
17

18
int main() {
19
  cin >> t;
20
  while(t--) {
21
    cin >> n;
22
    for(int i = 1; i <= n; i++) cin >> a[i];
23
    sort(a + 1, a + 1 + n, cmp);
24
    s[1] = 0, s[0] = 0;
25
    int c = 0;
26
    for(int i = 1; i <= n; i++) {
27
      if((a[i] & 1) == c) s[c] += 1ll * a[i];
28
      c = 1 - c;
29
    }
30
    if(s[0] > s[1]) puts("Alice");
31
    if(s[0] == s[1]) puts("Tie");
32
    if(s[0] < s[1]) puts("Bob");
33
  }
34
  return 0;
35
}

1
#include <cstdio>
2
#include <iostream>
3
#include <algorithm>
4
#include <cmath>
5
#include <cstring>
6
using namespace std;
7

8
const int maxn = 2e5 + 17;
9

10
int t, n;
11
struct frd {
12
  int h, w, id, ans;
13
} f[maxn];
14

15
bool cmp1(frd x, frd y) {
16
  return x.h < y.h;
17
}
18

19
bool cmp2(frd x, frd y) {
20
  return x.w < y.w;
21
}
22

23
bool cmp3(frd x, frd y) {
24
  return x.id < y.id;
25
}
26

27
int main(int argc, char const *argv[])
28
{
29
  cin >> t;
30
  while(t--) {
31
    cin >> n;
32
    for(int i = 1; i <= n; i++) f[i].id = i, f[i].ans = -1;
33
    for(int i = 1; i <= n; i++) cin >> f[i].h >> f[i].w;
34
    int mw = 1, mh = 1;
35
    sort(f + 1, f + 1 + n, cmp1);
36
    for(int i = 1, j; i <= n; i = j + 1) {
37
      for(j = i; f[j + 1].h == f[j].h; j++);
38
      if(i != 1) {
39
        for(int k = i; k <= j; k++) if(f[mw].w < max(f[k].w, f[k].h)) f[k].ans = f[mw].id;
40
      }
41
      for(int k = i; k <= j; k++) if(f[mw].w > f[k].w) mw = k;
42
    }
43
    // sort(f + 1, f + 1 + n, cmp3);
44
    // for(int i = 1; i <= n; i++) printf("%d%c", f[i].ans, " \n"[i == n]);
45
    sort(f + 1, f + 1 + n, cmp2);
46
    for(int i = 1, j; i <= n; i = j + 1) {
47
      for(j = i; f[j + 1].w == f[j].w; j++);
48
      if(i != 1) {
49
        for(int k = i; k <= j; k++) if(f[mh].h < fmax(f[k].w, f[k].h)) f[k].ans = f[mh].id;
50
      }
51
      for(int k = i; k <= j; k++) if(f[mh].h > f[k].h) mh = k;
52
    }
53
    sort(f + 1, f + 1 + n, cmp3);
54
    for(int i = 1; i <= n; i++) printf("%d%c", f[i].ans, " \n"[i == n]);
55
  }
56
  return 0;
57
}