zoj 4009 And Another Data Structure Problem

1至99971之间的数不断进行更新操作，取模后结果最长会在48次时循环，只要把前48次预处理出来就可以用线段树模板了。。。。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <bitset>
#include <map>

using namespace std;
#define scd(a) scanf("%d", &a)
#define scdd(a,b) scanf("%d%d", &a, &b)
#define scddd(a,b,c) scanf("%d%d%d", &a, &b, &c)
#define X first
#define Y second
typedef long long ll;
const int N = 1e5 + 20, mod = 99971;
int tree[N << 2][48], add[N << 2], mark1[48], mark2[48], a[N];
int n, m;
void pushUp(int rt)
{
    for(int i = 0; i < 48; i++)
        tree[rt][i] = (tree[rt<<1][i] + tree[rt<<1|1][i])%mod;
}
void pushDown(int rt)
{
        for(int i = 0; i < 48; i++){
            mark1[i] = tree[rt<<1][i];
            mark2[i] = tree[rt<<1|1][i];
        }
        for(int i = 0; i < 48; i++){
            tree[rt<<1][i] = mark1[(i + add[rt])%48];
            tree[rt<<1|1][i] = mark2[(i + add[rt])%48];
        }
        add[rt<<1] += add[rt];
        add[rt<<1|1] += add[rt];
        add[rt] = 0;
}
void build(int l, int r, int rt)
{
    if(l == r){
        tree[rt][0] = a[l] % mod;
        for(int i = 1; i < 48; i++){
            tree[rt][i] = (1LL*tree[rt][i - 1] * tree[rt][i - 1]%mod)* tree[rt][i - 1]%mod;
            //printf("%lld\n", tree[rt][i - 1]*tree[rt][i - 1]%mod);
        }
        return;
    }
    int m = (l + r) >> 1;
    build(l, m, rt<<1);
    build(m + 1, r, rt<<1|1);
    pushUp(rt);
}

int query(int l, int r, int L, int R, int rt)
{
    //printf("%d %d %d %d %d %d\n", rt, tree[rt][0], l, r, L, R);
    if(l >= L && r <= R){
        return tree[rt][0];
    }
    if(add[rt]) pushDown(rt);
    int m = (l + r) >> 1;
    int ans = 0;
    if(m >= L) ans = (ans + query(l, m, L, R, rt<<1))%mod;
    if(m < R) ans = (ans + query(m + 1, r, L, R, rt<<1|1))%mod;
    return ans;
}

void upDate(int l,int r,int L,int R,int rt)
{
    if(l >= L && r <= R){
        add[rt]++;
        for(int i = 0; i < 48; i++)
            mark1[i] = tree[rt][i];
        for(int i = 0; i < 48; i++)
            tree[rt][i] = mark1[(i + 1) % 48];
        return;
    }
    if(add[rt]) pushDown(rt);
    int m = (l + r)>>1;
    if(m >= L) upDate(l, m, L, R, rt<<1);
    if(m < R) upDate(m + 1, r, L, R, rt<<1|1);
    pushUp(rt);
}
void solve()
{
    scdd(n, m);
    for(int i = 1 ;i <= n; i++){
        scd(a[i]);
    }
    build(1, n, 1);
    for(int i = 0; i < m; i++){
        int o, l ,r;
        scddd(o, l, r);
        if(o == 1) upDate(1, n, l, r, 1);
        else printf("%d\n", query(1, n, l, r, 1));
    }
}
int main()
{
    #ifdef local
        freopen("in.txt", "r", stdin);
        //freopen("out.txt", "w", stdout);
    #endif // local
    int t;
    scd(t);
    while(t--){
        memset(add, 0, sizeof(add));
        memset(tree, 0, sizeof(tree));
        solve();
    }
    return 0;
}

巧妙的模数，以后要多多学会打表找规律。。。。。