2020年西北工业大学“编程之星”程序设计挑战赛 G 智乃与无意义的题目

用线段树进行维护，对每一个叶子结点质因数分解，得到它2 ,3,5,7做为因子的个数,向上合并的时候累加相同因子个数，最后查询的时候用因子个数公式计算得到。线段树太强了！！！好久没敲了。。。

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <cmath>
#include <string>
#include <vector>
#include <stack>
#include <map>
#include <sstream>
#include <cstring>
#include <set>
#include <cctype>
#define IO                       \
    ios::sync_with_stdio(false); \
    // cin.tie(0);                  \
    // cout.tie(0);
using namespace std;
typedef long long LL;
const int maxn = 1e5 + 5;
const int maxm = 1e6 + 10;
const LL INF = 0x3f3f3f3f3f3f3f3f;
const int inf = 0x3f3f3f3f;
const LL mod = 998244353;
int dis[8][2] = {0, 1, 1, 0, 0, -1, -1, 0};
int b[4] = {2, 3, 5, 7};
struct Node
{
    int p[4];
} tree[maxn * 4];
int n, m, a[maxn];
void count_div(int a, int pos)
{
    int now = a;
    for (int i = 0; i < 4; i++)
    {
        if (now % b[i] == 0)
        {
            while (now % b[i] == 0)
            {
                ++tree[pos].p[i];
                now /= b[i];
            }
        }
    }
}
void creat(int node, int start, int end)
{
    if (start == end)
    {
        count_div(a[end], node);
        return;
    }
    int mid = (start + end) >> 1;
    creat(node << 1, start, mid);
    creat(node << 1 | 1, mid + 1, end);
    for (int i = 0; i < 4; i++)
        tree[node].p[i] = tree[node << 1].p[i] + tree[node << 1 | 1].p[i];
    return;
}
void update(int node, int start, int end, int pos, int val)
{
    // cout << start << " " << end << endl;
    if (start == end)
    {
        for (int i = 0; i < 4; i++)
            tree[node].p[i] = 0;
        count_div(val, node);
        return;
    }
    int mid = (start + end) >> 1;
    if (pos >= mid + 1)
        update(node << 1 | 1, mid + 1, end, pos, val);
    else
        update(node << 1, start, mid, pos, val);
    for (int i = 0; i < 4; i++)
        tree[node].p[i] = tree[node << 1].p[i] + tree[node << 1 | 1].p[i];
}

LL query(int node, int start, int end, int l, int r, int id)
{
    if (start >= l && end <= r)
        return tree[node].p[id];
    int mid = (start + end) >> 1;
    LL ans = 0;
    if (r >= mid + 1)
        ans += query(node << 1 | 1, mid + 1, end, l, r, id);
    if (l <= mid)
        ans += query(node << 1, start, mid, l, r, id);
    return ans;
}
int main()
{
#ifdef ONLINE_JUDGE
#else
    freopen("in.txt", "r", stdin);
    // freopen("out.txt", "w", stdout);
#endif
    IO;
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    creat(1, 1, n);
    int mode, x, y;
    // for (int i = 0; i < 4; i++)
    //     cout << tree[1].p[i] << endl;
    for (int i = 0; i < m; i++)
    {
        cin >> mode;
        if (mode == 1)
        {
            cin >> x >> y;
            update(1, 1, n, x, y);
        }
        else
        {
            cin >> x >> y;
            LL res = 1;
            for (int i = 0; i < 4; i++)
            {
                res = (res % mod * (query(1, 1, n, x, y, i) + 1) % mod) % mod;
            }
            cout << res << endl;
        }
    }
    return 0;
}