Pagini recente » Cod sursa (job #1231502) | Istoria paginii runda/aparare | Cod sursa (job #1104429) | Cod sursa (job #2075566) | Cod sursa (job #1240969)
#include<stdio.h>
#include <list>
#include<fstream>
using namespace std;
ifstream f("datorii.in");
ofstream g("datorii.out");
int main(){
int n, m, v[15001], s, p, q, k,i,j;
f >> n >> m;
for (i = 1; i <= n; i++)
f >> v[i];
for (i = 1; i <= m; i++){
s = 0;
f >> k>>p>>q;
if (k == 1){
for (j = p; j <= q; j++){
s += v[j];
}
g << s<<'\n';
}
else{
v[p] -= q;
}
}
getchar();
return 0;
}