Pagini recente » Cod sursa (job #2293878) | Cod sursa (job #56306) | Cod sursa (job #2662765) | Cod sursa (job #823077) | Cod sursa (job #517426)
Cod sursa(job #517426)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int n, m, a[15000], k, p, q, s=0;
ifstream fin("datorii.in");
ofstream fout("datorii.out");
fin>>n>>m;
for (int i=0; i<n; i++){
fin>>a[i];
//cout<<a[i]<<" ";
}
for (int i=1; i<=m; i++){
fin>>k>>p>>q;
if (k==0)
a[p-1]=a[p-1]-q;
else {
for (int j=p-1; j<q; j++)
s+=a[j];
cout<<s<<endl;
s=0;
}
//cout<<k<<" "<<p<<" "<<q<<endl;
}
}