Cod sursa(job #2720477)
| Utilizator | Data | 10 martie 2021 21:25:32 | |
|---|---|---|---|
| Problema | Datorii | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.64 kb |
//#include <iostream>
#include <fstream>
using namespace std;
int main() {
ifstream fin ("datorii.in");
ofstream fout ("datorii.out");
int n, m, z[15001];
fin >> n >> m;
for (int i = 1; i <= n; i++)
fin >> z[i];
for (int i = 1; i <= m; i++) {
int x;
fin >> x;
if (x) {
int p, q, s=0;
fin >> p >> q;
while (p<=q) {
s += z[p];
p++;
}
fout << s << endl;
} else {
int t, v;
fin >> t >> v;
z[t] -= v;
}
}
fin.close();
fout.close();
return 0;
}
