Pagini recente » Cod sursa (job #1739488) | Cod sursa (job #493217) | Cod sursa (job #2325672) | Cod sursa (job #711571) | Cod sursa (job #2181255)
#include <iostream>
#include <fstream>
using namespace std;
void main() {
int n, m, A[100], M[100][4], v1, v2, s, y;
ifstream f("datorii.in");
ofstream g("datorii.out");
f >> n >> m;
for (int i = 0; i < n; i++)
f >> A[i];
for (int k = 0; k < m; k++)
{
f >> s >> v1 >> v2 ;
switch (s) {
case 0: {
A[v1-1] -= v2;
break;
}
case 1: {
y = 0;
for (int i = v1-1; i < v2; i++)
y += A[i];
g << y << endl;
break;
}
}
}
}