Pagini recente » Cod sursa (job #1727119) | Cod sursa (job #1885973) | Cod sursa (job #2451026) | Cod sursa (job #3137324) | Cod sursa (job #1550701)
#include <fstream>
#include <iostream>
using namespace std;
int main()
{
ifstream f("datorii.in");
ofstream g("datorii.out");
int N, T, V, P, Q, i, x;
long M, sum;
f >> N >> M;
int* A = new int[N];
for (i = 1; i <= N; i++)
f >> A[i];
while (!f.eof())
{
f >> x;
if (x == 1)
{
f >> P >> Q;
sum = 0;
for (i = P; i <= Q; i++)
sum += A[i];
g << sum << endl;
}
else
{
f >> T >> V;
A[T] = A[T] - V;
}
}
return