Pagini recente » Cod sursa (job #1439486) | Cod sursa (job #1037473) | Cod sursa (job #1938947) | Cod sursa (job #3272531) | Cod sursa (job #381376)
Cod sursa(job #381376)
#include<fstream.h>
ifstream fin("datorii.in");
ofstream fout("datorii.out");
int n,m,d,tp,qv,i,j,s,v[15001],sa;
int sum(int i,int j)
{
long p=i;
sa=sa+v[p];
if(i<j)
sum(i+1,j);
return sa;
}
int main()
{
fin>>n>>m;
for(i=1;i<=n;i++)
fin>>v[i];
for(i=1;i<=m;i++)
{
fin>>d>>tp>>qv;
if(d==1)
{
sa=0;
fout<<sum(tp,qv)<<'\n';
}
else
v[tp]=v[tp]-qv;
}
return 0;
}