Pagini recente » Cod sursa (job #2586880) | Cod sursa (job #1661079) | Cod sursa (job #1128731) | Cod sursa (job #2077575) | Cod sursa (job #378435)
Cod sursa(job #378435)
#include<fstream.h>
ifstream fin("datorii.in");
ofstream fout("datorii.out");
int n,m,d,tp,qv,i,j,v[15001];
int sum(int k)
{
int c=0,s=0;
while(c<k)
{
c++;
s=s+v[c];
}
return s;
}
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)
fout<<sum(qv)-sum(tp-1)<<'\n';
else
v[tp]=v[tp]-qv;
}
return 0;
}