Pagini recente » Cod sursa (job #2132750) | Cod sursa (job #2324363) | Cod sursa (job #1015075) | Cod sursa (job #2619574) | Cod sursa (job #2567324)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream in;
ofstream out;
int N, M;
in.open("datorii.in");
out.open("datorii.out");
in >> N >> M;
int A[N];
for (int i=0; i<N; i++)
in >> A[i];
for (int i=0; i<M; i++){
int cod, P, Q;
in >> cod >> P >> Q;
if (cod == 0)
A[P-1] -= Q;
else{
int s = 0;
for (int j=P-1; j<Q; j++)
s += A[j];
out << s << '\n';
}
}
return 0;
}