HDU 4267 A Simple Problem with Integers --树状数组

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
using namespace std;
#define N 50007

int c[N][11][11];
int n,ka[N];

int lowbit(int x){ return x & (-x); };

void modify(int pos,int k,int mod,int val)
{
    if(pos == 0) return;
    while(pos <= n)
    {
        c[pos][k][mod] += val;
        pos += lowbit(pos);
    }
}

int getsum(int pos)
{
    int res = 0;
    int tmp = pos;
    while(pos > 0)
    {
        for(int i=1;i<=10;i++)
            res += c[pos][i][tmp%i];
        pos -= lowbit(pos);
    }
    return res;
}

int main()
{
    int m,a,b,k,val,i,j;
    int op;
    while(scanf("%d",&n)!=EOF)
    {
        for(i=1;i<=n;i++)
            scanf("%d",&ka[i]);
        memset(c,0,sizeof(c));
        scanf("%d",&m);
        while(m--)
        {
            scanf("%d",&op);
            if(op == 1)
            {
                scanf("%d%d%d%d",&a,&b,&k,&val);
                modify(a,k,a%k,val);
                modify(b+1,k,a%k,-val);
            }
            else
            {
                scanf("%d",&a);
                printf("%d\n",ka[a] + getsum(a));
            }
        }
    }
    return 0;
}