Pagini recente » Cod sursa (job #2130589) | Cod sursa (job #1544632) | Cod sursa (job #2571325) | Cod sursa (job #1560680) | Cod sursa (job #29265)
Cod sursa(job #29265)
#include<stdio.h>
#include<math.h>
#define MaxN 15001
long N,a[MaxN];
long M,S[MaxN],c[MaxN];
int main ()
{FILE *f,*g;long i;
long j;
long P,x;
S[0]=0;
f=fopen("datorii.in","r");
g=fopen("datorii.out","w");
fscanf(f,"%ld %ld\n",&N,&M);
S[0]=0;
for(i=1;i<=N;i++)
{fscanf(f,"%ld",&a[i]);S[i]=S[i-1]+a[i];
x=(i^(i-1))&i;
P=i-x;
c[i]=S[i]-S[P];
}
long S1,S2;
long O;
long T,V;
long q,p;
for(j=1;j<=M;j++)
{fscanf(f,"%ld",&O);
if(O==0) {fscanf(f,"%ld %ld\n",&T,&V);
while (T<=N)
{c[T]-=V;
T+=(T^(T-1))&T;
}
}
else { fscanf(f,"%ld %ld\n",&p,&q);
S1=S2=0;
p--;
while (p>0)
{S1+=c[p];
p-=(p^(p-1))&p;
}
while (q>0)
{S2+=c[q];
q-=(q^(q-1))&q;
}
fprintf(g,"%ld\n",S2-S1);
}
}
fclose(f);
fclose(g);
return 0;}