1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
| #include <bits/stdc++.h>
#define rep(i,j,k) for (int i = j; i <= k; i++)
#define per(i,j,k) for (int i = j; i >= k; i--)
#define loop(i,j,k) for (int i = j;i != -1; i = k[i])
#define lson x << 1, l, mid
#define rson x << 1 | 1, mid + 1, r
#define ff first
#define ss second
#define mp(i,j) make_pair(i,j)
#define pb push_back
#define pii pair<int,LL>
#define in(x) scanf("%d", &x);
using namespace std;
typedef long long LL;
const int low(int x) { return x&-x; }
const double eps = 1e-4;
const int INF = 0x7FFFFFFF;
const int N = 4e5 + 10;
int T, n, m, l, r;
int g[N],d[N];
long long s[N], k[N];
int gcd(int x, int y) {
return x%y ? gcd(y, x%y) : y;
}
void build(int x,int l,int r) {
if (l == r) {
scanf("%d",&g[x]);
d[r] = g[x];
}
else {
int mid = l + r >> 1;
build(lson);
build(rson);
g[x] = gcd(g[x<<1], g[x<<1|1]);
}
}
int query(int x,int l,int r,int ll,int rr) {
if (ll<=l && r<=rr) return g[x];
int mid = l + r>>1;
if (rr <= mid) return query(lson,ll,rr);
else if (ll > mid) return query(rson,ll,rr);
else return gcd(query(lson,ll,rr),query(rson,ll,rr));
}
void pushUp(int rt) {
s[rt] = s[2 * rt] + s[2 * rt + 1];
}
void pushDown(int rt, int l, int r) {
if(k[rt] == 0) return;
int mid = (l + r) / 2;
s[2 * rt] += (k[rt] * (mid - l + 1));
s[2 * rt + 1] += (k[rt] * (r - mid));
k[2 * rt] += k[rt];
k[2 * rt + 1] += k[rt];
k[rt] = 0;
}
void update(int L, int R, long long val, int l, int r, int rt) {
if(L <= l && r <= R) {
s[rt] += (val * (r - l + 1));
k[rt] += val;
return;
}
int mid = (l + r) / 2;
pushDown(rt, l, r);
if(L <= mid) update(L, R, val, l, mid, 2 * rt);
if(R > mid) update(L, R, val, mid + 1, r, 2 * rt + 1);
pushUp(rt);
}
long long get(int L, int R, int l, int r, int rt) {
if(L <= l && r <= R) return s[rt];
pushDown(rt, l, r);
int mid = (l + r) / 2;
long long left = 0, right = 0;
if(L <= mid) left = get(L, R, l, mid, 2 * rt);
if(R > mid) right = get(L, R, mid + 1, r, 2 * rt + 1);
pushUp(rt);
return left + right;
}
struct point{
int l,r,g, id;
}c[N];
struct point2 {
int l1, l2, r, g;
}h[N];
int szh;
long long ans[N];
bool cmpc(const point& a, const point& b) {
if(a.g != b.g) return a.g < b.g;
return a.r < b.r;
}
bool cmph(const point2& a, const point2& b) {
if(a.g != b.g) return a.g < b.g;
return a.r < b.r;
}
bool cmpid(const point& a, const point& b ) {
return a.id < b.id;
}
int main() {
#ifdef ZHOUZHENTAO
freopen("test.in", "r", stdin);
#endif
scanf("%d", &T);
int cas = 0;
while (T--) {
scanf("%d", &n);
build(1, 1, n);
scanf("%d", &m);
printf("Case #%d:\n", ++cas);
for (int i = 0;i< m ;i++) {
scanf("%d%d", &c[i].l, &c[i].r);
c[i].g = query(1, 1, n, c[i].l, c[i].r);
c[i].id = i;
}
szh = 0;
stack<pii> a, b;
rep(i, 1, n) {
a.push(mp(d[i], 1));
while (!a.empty()) b.push(mp(gcd(a.top().ff, d[i]), a.top().ss)), a.pop();
while (!b.empty()) {
pii q = b.top(); b.pop();
if (!a.empty() && a.top().ff == q.ff) q.ss += a.top().ss, a.pop();
a.push(q);
}
int L = i;
while (!a.empty()) {
pii q = a.top(); a.pop();
int LL = L - q.second + 1;
h[szh].l1 = LL;
h[szh].l2 = L;
h[szh].r = i;
h[szh].g = q.first;
szh ++;
L = LL - 1;
b.push(q);
}
while (!b.empty()) {
a.push(b.top()); b.pop();
}
}
sort(c, c + m, cmpc);
sort(h, h + szh, cmph);
for(int i = 0; i < m; i ++) {
ans[i] = 0;
}
for(int i = 0, j = 0; i < szh; i = j + 1, j = i) {
while(j < szh - 1 && h[j].g == h[j + 1].g) j ++;
int L = 0, R = m - 1, pos1 = -1, pos2 = -1;
while(L <= R) {
int mid = (L + R) / 2;
if(c[mid].g < h[i].g) L = mid + 1;
else if(c[mid].g > h[i].g) R = mid - 1;
else pos1 = mid, R = mid - 1;
}
if(pos1 == -1) continue;
L = 0, R = m - 1;
while(L <= R) {
int mid = (L + R) / 2;
if(c[mid].g < h[i].g) L = mid + 1;
else if(c[mid].g > h[i].g) R = mid - 1;
else pos2 = mid, L = mid + 1;
}
int y = i;
for(int k = pos1; k <= pos2; k ++) {
while(y <= j && h[y].r <= c[k].r) {
update(h[y].l1, h[y].l2, 1LL, 1, n, 1);
y ++;
}
ans[c[k].id] = get(c[k].l, c[k].r, 1, n, 1);
}
for(int k = i; k < y; k ++) {
update(h[k].l1, h[k].l2, -1LL, 1, n, 1);
}
}
sort(c, c + m, cmpid);
for(int i = 0; i < m; i ++) {
printf("%d ", c[i].g);
printf("%lld\n", ans[i]);
}
}
return 0;
}
|
