1
#include <bits/stdc++.h>
2
using namespace std;
3

4
typedef long long ll;
5
const int mo = 998244353;
6

7
int T;
8

9
int main () {
10
    scanf("%d", &T);
11
    while(T--) {
12
        int p;
13
        scanf("%d", &p);
14
        printf("%d %d\n", 2, p - 1);
15
    }
16
    return 0;
17
}

1
#include <bits/stdc++.h>
2
using namespace std;
3

4
const int maxn = 2e5 + 17;
5
int n, ans, T;
6
int v[maxn];
7
char s[maxn], t[maxn];
8

9

10
void Init(){
11
    scanf("%d", &n);
12
    for(int i = 1; i <= n; i++) v[i] = 0;
13
    ans = 0;
14
    scanf("%s", s + 1);
15
    scanf("%s", t + 1);
16
    for(int i = 1; i <= n; i++) {
17
        if(t[i] == '1') {
18
            if(i > 1 && s[i - 1] == '1' && !v[i - 1]) {
19
                v[i - 1] = 1;
20
                ans++;
21
            }
22
            else if(s[i] == '0' && !v[i]) {
23
                v[i] = 1;
24
                ans++;
25
            }
26
            else if(i < n && s[i + 1] == '1' && !v[i + 1]) {
27
                v[i + 1] = 1;
28
                ans++;
29
            }
30
        }
31
    }
32
}
33

34

35
int main(){
36
    scanf("%d", &T);
37
    while(T--) {
38
        Init();
39
        printf("%d\n",ans);
40
    }
41
    return 0;
42
}

1
#include <bits/stdc++.h>
2
using namespace std;
3

4
const int maxn = 2e5 + 17;
5
int n, ans, T, m;
6
set<int> s[maxn];
7

8

9
int main(){
10
    scanf("%d%d", &n, &m);
11
    ans = n;
12
    for(int i = 1; i <= m; i++) {
13
        int u, v;
14
        scanf("%d%d", &u, &v);
15
        if(u > v) swap(u, v);
16
        s[u].insert(v);
17
    }
18
    for(int i = 1; i <= n; i++) if(s[i].size()) ans--;
19
    scanf("%d", &T);
20
    while(T--) {
21
        int t, u, v;
22
        scanf("%d", &t);
23
        if(t == 2) {
24
            scanf("%d%d", &u, &v);
25
            if(u > v) swap(u, v);
26
            s[u].erase(v);
27
            if(s[u].empty()) ans++;
28
        }
29
        else if(t == 1) {
30
            scanf("%d%d", &u, &v);
31
            if(u > v) swap(u, v);
32
            if(s[u].empty()) ans--;
33
            s[u].insert(v);
34
        }
35
        else {
36
            printf("%d\n",ans);
37
        }
38
    }
39
    return 0;
40
}

1
#include <bits/stdc++.h>
2
using namespace std;
3

4
typedef long long ll;
5
const int maxn = 2e5 + 17;
6
const int times = 7;
7
ll a[maxn], b[maxn];
8
int T, n, cur, ans;
9
set<ll> s[2];
10
map<ll, int> mp;
11

12
int A[] = { 2, 325, 9375, 28178, 450775, 9780504, 1795265022};
13

14
ll  Random(ll x) {
15
  return (double(rand()) / RAND_MAX * x + 0.5);
16
}
17

18
ll gcd(ll x, ll y) {
19
  if (x < 0) return gcd(-x, y);//加上这个能快些
20
  return y ? gcd(y, x%y) : x;
21
}
22

23
ll q_mul(ll x, ll y, ll mod) {
24
  ll xns = 0;
25
  while (y) {
26
    if (y & 1)  xns = (xns + x) % mod;
27
    x = (x << 1) % mod;
28
    y >>= 1;
29
  }
30
  return xns;
31
}
32

33
ll q_pow(ll x, ll y, ll mod) {
34
  ll xns = 1;
35
  while (y) {
36
    if (y & 1)  xns = q_mul(xns, x, mod);
37
    x = q_mul(x, x, mod);
38
    y >>= 1;
39
  }
40
  return xns;
41
}
42

43
ll pr(ll N, ll c) {//找到x的一个因子
44
  ll x, y, d, i = 1, k = 2;
45
  y = x = Random(N - 1) + 1;
46
  while (1) {
47
    i++;
48
    x = (q_mul(x, x, N) + c) % N;
49
    d = gcd(y - x, N);
50
    if (1<d&&d<N) return d;
51
    if (y == x) return N;//找到循环，选取失败，重新来
52
    if (i == k) {//似乎是一个优化，但是不是很清楚
53
      y = x;
54
      k <<= 1;
55
    }
56
  }
57
}
58

59
bool is_prime(ll x) {
60
    if(x < 2) return 0;
61
    if(x == 2) return 1;
62
    if(!(x & 1)) return 0;
63
    ll k, j = 0, X, tem = x - 1;
64
    while(!(tem & 1)) tem >>= 1, j++;
65
    for(int i = 0; i < times; i++) {
66
        if(A[i] >= x) return 1;
67
        X = q_pow(A[i], tem, x);
68
    if(X == 1) continue;
69
    for(k = 0; k < j; k++) {
70
      if(X == x - 1) break;
71
      X = q_mul(X, X, x);
72
    }
73
    if(k == j) return 0;
74
    }
75
  return 1;
76
}
77

78
void fct(ll x) {
79
    if(x == 1) return;
80
    if(is_prime(x)) {
81
    // cout << x << endl;
82
        s[cur].insert(x);
83
    return;
84
    }
85
    ll p = x;
86
  // cout << p << endl;
87
    while(p >= x) p = pr(p, Random(x) + 1);
88
    fct(p);
89
    fct(x / p);
90
    return;
91
}
92

93
int main() {
94
    freopen("data.in", "r", stdin);
95
    scanf("%d", &T);
96
    while(T--) {
97
    ans = 0;
98
    mp.clear();
99
    s[1].clear(), s[0].clear();
100
    cur = 0;
101
        scanf("%d", &n);
102
        for(int i = 1; i <= n; i++) scanf("%lld", &a[i]);
103
        for(int i = 1; i < n; i++) b[i] = abs(a[i + 1] - a[i]);
104
        for(int i = 1; i <= n; i++, cur ^= 1) {
105
      // s[cur].clear();
106
            if(i < n) fct(b[i]);
107
            // for(auto &it : s[cur ^ 1]) {
108
      //   if(s[cur].count(it)) mp[it]++;
109
      //   else {
110
      //     ans = max(ans, mp[it]);
111
      //     mp.erase(it);
112
      //   }
113
            // }
114
        }
115
    printf("%d\n", ans + 2);
116
    }
117
    return 0;
118
}
119

120
/*
121
1
122
3
123
61 1 13
124

125
*/

1
#include <bits/stdc++.h>
2
using namespace std;
3

4
typedef long long ll;
5
ll oo = 1e18;
6
int N = 1e3;
7
ll  Random(ll n) {
8
  return (double(rand()) / RAND_MAX * n + 0.5);
9
}
10

11
int main() {
12
    freopen("data.in", "w", stdout);
13
    puts("1");
14
    printf("%d\n", N);
15
    for(int i = 1; i <= N; i++) printf("%lld%c", Random(oo), " \n"[i == N]);
16
    return 0;
17
}