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

8
int main() {
9
  int t;
10
  cin >> t;
11
  while(t--) {
12
    int r, b, d;
13
    cin >> r >> b >> d;
14
    if(r > b) swap(r, b);
15
    if(r <= b &&  1ll * b <= 1ll * (1 + d) * r) cout << "YES" << endl;
16
    else cout << "NO" << endl;
17
  }
18
  return 0;
19
}

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

8
int main() {
9
  int t;
10
  cin >> t;
11
  while(t--) {
12
    int n, m, k;
13
    cin >> n >> m >> k;
14
    if(k == n * m - 1) cout << "YES" << endl;
15
    else cout << "NO" << endl;
16
  }
17
  return 0;
18
}

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

9
typedef long long ll;
10
const int maxn = 2e5 + 17;
11
int n, u[maxn];
12
vector<ll> v[maxn];
13
ll s[maxn];
14
int sz[maxn];
15

16
bool cmp(ll a, ll b) {
17
  return a > b;
18
}
19

20
int main() {
21
  int T;
22
  scanf("%d", &T);
23
  while(T--) {
24
    scanf("%d", &n);
25
    for(int i = 1; i <= n; i++) {
26
      s[i] = 0;
27
      v[i].clear();
28
      sz[i] = 0;
29
    }
30
    for(int i = 1; i <= n; i++) scanf("%d", &u[i]);
31
    for(int i = 1; i <= n; i++) {
32
      int tmp; scanf("%d", &tmp);
33
      v[u[i]].push_back(1ll * tmp);
34
      sz[u[i]]++;
35
    }
36
    for(int i = 1; i <= n; i++) {
37
      int t = sz[i];
38
      sort(v[i].begin(), v[i].end(), cmp);
39
      // for(int j = 0; j < t; j++) printf("%d%c", v[i][j], " \n"[j == t - 1]);
40
      for(int j = 1; j < t; j++) v[i][j] = v[i][j] + v[i][j - 1];
41
      for(int j = 1; j <= t; j++) {
42
        s[j] += v[i][t / j * j - 1];
43
      }
44
    }
45
    for(int i = 1; i <= n; i++) printf("%lld%c", s[i], " \n"[i == n]);
46
  }
47
  return 0;
48
}

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

9
typedef long long ll;
10
const int maxn = 5e3 + 17;
11
int n;
12
ll a[maxn], b[maxn], f[maxn][maxn], ans;
13

14
bool cmp(ll a, ll b) {
15
  return a > b;
16
}
17

18
int main() {
19
  cin >> n;
20
  for(int i = 1; i <= n; i++) cin >> a[i];
21
  for(int i = 1; i <= n; i++) cin >> b[i];
22
  for(int i = 1; i <= n; i++) f[1][1] += a[i] * b[i];
23
  for(int i = 2; i <= n; i++) f[i][i] = f[1][1];
24
  ans = f[1][1];
25
  // cout << ans << endl;
26
  for(int l = 1; l < n; l++) {
27
    int r = l + 1;
28
    f[l][r] = f[1][1] - a[l] * b[l] - a[r] * b[r] + a[l] * b[r] + a[r] * b[l];
29
    ans = max(ans, f[l][r]);
30
  }
31
  for(int i = 3; i <= n; i++) {
32
    for(int l = 1; l + i - 1 <= n; l++) {
33
      int r = l + i - 1;
34
      f[l][r] = f[l + 1][r - 1] - a[l] * b[l] - a[r] * b[r] + a[l] * b[r] + a[r] * b[l];
35
      ans = max(ans, f[l][r]);
36
    }
37
  }
38
  // cout << f[3][5] << endl;
39
  cout << ans << endl;
40
  return 0;
41
}