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