1
#include <cstdio>
2
#include <iostream>
3
using namespace std;
4
int a, b;
5

6
int main() {
7
  int t;
8
  cin >> t;
9
  while(t--) {
10
    cin >> a >> b;
11
    cout << a * b << endl;
12
  }
13
  return 0;
14
}

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 T, c, m, n, a[maxn];
10

11
int main() {
12
  cin >> T;
13
  while(T--) {
14
    cin >> n; for(int i = 1; i <= n; i++) cin >> a[i];
15
    if(a[1] == a[2]) {
16
      int flg = 1;
17
      for(int i = 2; i <= n; i++) if(a[i - 1] != a[i]) flg = 0;
18
      if(flg) cout << 0 << endl;
19
      else cout << -1 << endl;
20
      continue;
21
    }
22
    else if(a[1] < a[2]) {
23
      int flg = 1;
24
      c = a[2] - a[1];
25
      m = 0;
26
      for(int i = 1; i < n; i++) {
27
        if(a[i + 1] < a[i]) {
28
          m = a[i] + c - a[i + 1];
29
          break;
30
        }
31
      }
32
      if(m == 0) {
33
        for(int i = 1; i < n; i++) {
34
          if(a[i + 1] != (a[i] + c) ) flg = 0;
35
        }
36
        if(flg) cout << 0 << endl;
37
        else cout << -1 << endl;
38
        continue;
39
      }
40
      for(int i = 1; i < n; i++) {
41
        if(a[i] >= m || a[i + 1] >= m) flg = 0;
42
        if(a[i + 1] != (a[i] + c) % m) flg = 0;
43
      }
44
      if(flg) cout << m << " " << c << endl;
45
      else cout << -1 << endl;
46
      continue;
47
    }
48
    else {
49
      int flg = 1;
50
      c = 0;
51
      for(int i = 1; i < n; i++) {
52
        if(a[i + 1] > a[i]) c = a[i + 1] - a[i];
53
      }
54
      if(c == 0) {
55
        c = a[2] - a[1];
56
        for(int i = 1; i < n; i++) {
57
          if(a[i + 1] != (a[i] + c) ) flg = 0;
58
        }
59
        if(flg) cout << 0 << endl;
60
        else cout << -1 << endl;
61
        continue;
62
      }
63
      m = a[1] - a[2] + c;
64
      for(int i = 1; i < n; i++) {
65
        if(a[i] >= m || a[i + 1] >= m) flg = 0;
66
        if(a[i + 1] != (a[i] + c) % m) flg = 0;
67
      }
68
      if(flg) cout << m << " " << c << endl;
69
      else cout << -1 << endl;
70
      continue;
71
    }
72
  }
73
  return 0;
74
}

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

9
const int maxn = 1e5 + 17;
10

11
struct day {
12
  int s, id;
13
  vector<int> v;
14
} d[maxn];
15
int T, n, m, c[maxn], p, ans[maxn];
16

17
bool cmp(day A, day B) {
18
  return A.s < B.s;
19
}
20

21
bool ccmp(int A, int B) {
22
  // cout << A << " " << B << endl;
23
  return c[A] > c[B];
24
}
25

26
int main() {
27
  cin >> T;
28
  while(T--) {
29
    cin >> n >> m;
30
    for(int i = 1; i <= m; i++) {
31
      cin >> d[i].s;
32
      d[i].id = i;
33
      for(int j = 0; j < d[i].s; j++) {
34
        int tmp; cin >> tmp;
35
        d[i].v.push_back(tmp);
36
        c[tmp]++;
37
      }
38
    }
39
    for(int i = 1; i <= n; i++) c[i] = min(c[i], (m + 1) / 2);
40
    sort(d + 1, d + 1 + m, cmp);
41
    int flg = 1;
42
    for(int i = 1; i <= m; i++) {
43
      p = i;
44
      if(d[i].v.empty()) {
45
        flg = 0;
46
        break;
47
      }
48
      // cout << d[i].id << endl;
49
      // cout << c[d[p].v[0]] << " " << c[d[p].v[1]] << endl;
50
      sort(d[i].v.begin(), d[i].v.end(), ccmp);
51
      // cout << "wan" << endl;
52
      if(c[d[p].v[0]] == 0) {
53
        flg = 0;
54
        break;
55
      }
56
      else {
57
        c[d[p].v[0]]--;
58
        ans[d[i].id] = d[p].v[0];
59
      }
60
    }
61
    puts(flg ? "YES" : "NO");
62
    if(flg) for(int i = 1; i <= m; i++) printf("%d%c", ans[i], " \n"[i == m]);
63

64
    for(int i = 1; i <= n; i++) c[i] = 0;
65
    for(int i = 1; i <= m; i++) {
66
      ans[i] = 0;
67
      d[i].v.clear();
68
    }
69
  }
70

71
  return 0;
72
}

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

9
const int maxn = 1e5 + 17;
10
int T, n, a[maxn];
11
int pre[maxn], nxt[maxn];
12
int hd[maxn], ed[maxn];
13
int fa[maxn];
14
vector<int> ans;
15

16
int gcd(int x, int y) {
17
  return y ? gcd(y, x % y) : x;
18
}
19

20
int getf(int x) {
21
  return fa[x] == x ? x : fa[x] = getf(fa[x]);
22
}
23

24
int main() {
25
  cin >> T;
26
  while(T--) {
27
    ans.clear();
28
    cin >> n; for(int i = 1; i <= n; i++) cin >> a[i];
29
    if(n == 1 && a[1] != 1) {
30
      cout << 0 << endl;
31
      continue;
32
    }
33
    for(int i = 1; i <= n; i++) fa[i] = i;
34
    pre[1] = n; for(int i = 2; i <= n; i++) pre[i] = i - 1;
35
    for(int i = 1; i < n; i++) nxt[i] = i + 1;
36
    nxt[n] = 1;
37
    for(int j = 1; 1;) {
38
      int i = j;
39

40
      while(gcd(a[i], a[pre[i]]) > 1) {
41
        i = pre[i];
42
      }
43
      // cout << i << j << endl;
44
      for(int h = j; h != pre[i]; h = pre[h]) fa[getf(h)] = getf(j);
45
      hd[getf(i)] = i, ed[getf(j)] = j;
46
      j = pre[i];
47
      if(j == 1) break;
48
    }
49

50
    for(int p = 1, fst = 1; 1;) {
51
      if(fst) {
52
        fst = 0;
53
        p = nxt[p];
54
        continue;
55
      }
56
      if(pre[p] == ed[getf(pre[p])]) {
57
        nxt[pre[p]] = nxt[p];
58
        pre[nxt[p]] = pre[p];
59
        ans.push_back(p);
60
        fst = 1;
61
        if(gcd(a[pre[p]], a[nxt[p]]) > 1) {
62
          int fn = getf(nxt[p]), fp = getf(pre[p]);
63
          if(fn == fp) {
64
            break;
65
          }
66
          else{
67
            fa[fn] = fp;
68
            ed[fp] = ed[fn];
69
          }
70
        }
71
      }
72
      else p = ed[getf(p)];
73

74
      if(nxt[p] != p) p = nxt[p];
75
      else break;
76
    }
77
    int cnt = ans.size();
78
    cout << cnt << " ";
79
    for(int i = 0; i < cnt; i++) cout << ans[i] << " \n"[i == cnt - 1];
80
  }
81

82
  return 0;
83
}