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

8
int gcd(int a, int b) {
9
  return b ? gcd(b, a % b) : a;
10
}
11

12
int main() {
13
  int T;
14
  cin >> T;
15
  while(T--) {
16
    int A, B;
17
    cin >> A >> B;
18
    int g = gcd(A, B);
19
    int a = A / g, b = B / g;
20
    if(B != 1) cout << "YES" << endl << 1ll * (B - 1) * a * g << " " << 1ll * (B + 1) * a * g<< " " << 1ll * 2 * b * a * g * g << endl;
21
    else cout << "NO" << endl;
22
  }
23
  return 0;
24
}

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

8
const int maxn = 1e5 + 17;
9
int n, a[maxn], mn, p;
10

11
int main() {
12
  int t; scanf("%d", &t);
13
  while(t--) {
14
    scanf("%d", &n);
15
    for(int i = 1; i <= n; i++) scanf("%d", &a[i]);
16
    mn = 0x3f3f3f3f;
17
    for(int i = 1; i <= n; i++) mn = min(mn, a[i]);
18
    for(int i = 1; i <= n; i++) if(a[i] == mn) p = i;
19
      printf("%d\n", n - 1);
20
    for(int i = 1; i <= n; i++) {
21
      if(i == p) continue;
22
      if((i & 1) == (p & 1)) printf("%d %d %d %d\n", i, p, mn, mn);
23
      else printf("%d %d %d %d\n", i, p, mn + 1, mn);
24
    }
25
  }
26
  return 0;
27
}

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

8
int add(int x, int y) {
9
  return x + y;
10
}
11

12
int main() {
13
  int a = 0;
14
  a = add(++a, ++a);
15
  cout << a << endl;
16
  return 0;
17
}