Pagini recente » Cod sursa (job #2853472) | Cod sursa (job #1406880) | Cod sursa (job #628136) | Cod sursa (job #2219071) | Cod sursa (job #1435628)
#include <iostream>
#include<cstdio>
using namespace std;
int aib[15001], s[15001], n2[15001];
int query(int n)
{
int sum=0;
while(n>0)
{
sum+=aib[n];
n-=n2[n];
}
return sum;
}
int putdoi(int n)
{
int i=1;
while(n%2==0)
{
i*=2;
n/=2;
}
return i;
}
int main()
{
freopen("datorii.in","r",stdin);
freopen("datorii.out","w",stdout);
int n, m, nr,c,i,a,b;
scanf("%d%d", &n,&m);
for(i=1;i<=n;i++)
{
scanf("%d", &nr);
s[i]=s[i-1]+nr;
n2[i]=putdoi(i);
}
for(i=1;i<=n;i++)
aib[i]=s[i]-s[i-n2[i]];
for(i=1;i<=m;i++)
{
scanf("%d", &c);
if(c==0)
{
scanf("%d%d", &b, &a);
while(b<=n)
{
aib[b]-=a;
b+=n2[b];
}
}
else
{
scanf("%d%d", &a, &b);
printf("%d\n", query(b)-query(a-1));
}
}
return 0;
}