Pagini recente » Cod sursa (job #2515206) | Cod sursa (job #2506991) | Cod sursa (job #1035047) | Cod sursa (job #3166734) | Cod sursa (job #1707469)
#include<cstdio>
#include<cmath>
using namespace std;
int AIB[15005];
int putere(int baza,int exp)
{
int p=1;
for(int i=1;i<=exp;i++)
{
p*=baza;
}
return p;
}
int zerouri(int x)
{
int z=0;
int p=1;
while (!(x%p))
{
p*=2;
z++;
}
return z-1;
}
int suma(int x)
{
int poz=x;
int z=0;
int suma=0;
while (poz>0)
{
suma=suma+AIB[poz];
z=zerouri(poz);
poz=poz-putere(2,z);
}
return suma;
}
int n,m,c,element,valoare,poz,z,p,q,x;
int main()
{
freopen("datorii.in","r",stdin);
freopen("datorii.out","w",stdout);
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)
{
scanf("%d",&x);
int poz=i;
while (poz<=n)
{
AIB[poz]+=x;
z=zerouri(poz);
poz=poz+putere(2,z);
}
}
for(int i=1;i<=m;i++)
{
scanf("%d",&c);
if (!c)
{
scanf("%d%d",&element,&valoare);
poz=element;
while (poz<=n)
{
AIB[poz]-=valoare;
z=zerouri(poz);
poz=poz+putere(2,z);
}
}
else
{
scanf("%d%d",&p,&q);
printf("%d\n",suma(q)-suma(p-1));
}
}
return 0;
}