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

#include <cstdio>
#include <algorithm>
#include <cmath>
using namespace std;
typedef long long LL;
const int INF = 1009999999;
int n;
LL sum[500005], A[500005];
bool all[500005];
void pu(int now) {
    sum[now] = sum[now << 1] + sum[now << 1 | 1];
    all[now] = all[now << 1] && all[now << 1 | 1];
}
void build(int now, int l, int r) {
    if (l == r) {
        sum[now] = A[l];
        if (sum[now] == 1 || sum[now] == 0)
            all[now] = true;
        return;
    }
    int mid = (l + r) >> 1;
    build(now << 1, l, mid);
    build(now << 1 | 1, mid + 1, r);
    pu(now);
}
LL query(int now, int l, int r, int ll, int rr) {
    if (ll <= l && r <= rr) {
        return sum[now];
    }
    int mid = (l + r) >> 1;
    LL ret = 0;
    if (ll <= mid) ret += query(now << 1, l, mid, ll, rr);
    if (rr > mid) ret += query(now << 1 | 1, mid + 1, r, ll, rr);
    return ret;
}
void change(int now, int l, int r, int ll, int rr) {
    if (all[now]) {
        return;
    }
    if (l == r) {
        sum[now] = sqrt(sum[now]);
        if (sum[now] == 1 || sum[now] == 0)
            all[now] = true;
        return;
    }
    int mid = (l + r) >> 1;
    if (ll <= mid) change(now << 1, l, mid, ll, rr);
    if (rr > mid) change(now << 1 | 1, mid + 1, r, ll, rr);
    pu(now);
}
int main() {
    scanf("%d", &n);
    for (int i = 1; i <= n; ++i)
        scanf("%lld", A+i);
    build(1, 1, n);
    int m, x, y, z;
    scanf("%d", &m);
    while (m--) {
        scanf("%d%d%d", &x, &y, &z);
        if (y > z) swap(y, z);
        if (x==1) {
            printf("%lld\n", query(1, 1, n, y, z));
        } else {
            change(1, 1, n, y, z);
        }
    }
    return 0;
}