Pagini recente » Cod sursa (job #1324013) | Cod sursa (job #3122618) | Cod sursa (job #954456) | Cod sursa (job #1252014) | Cod sursa (job #1240202)
#include <fstream>
#include <iostream>
using namespace std;
int main()
{
ifstream f("datorii.in");
ofstream g("datorii.out");
int N, T, V, P, Q, i, j, M, sum, A[15000];
//long M, sum;
bool tf;
f >> N >> M;
//int* A = new int[N];
for(i = 1; i <= N; i++)
f >> A[i];
for(j = 1; j <= M; j++)
{
f >> tf;
if(tf == true)
{
f >> P >> Q;
sum = 0;
for (i = P; i <= Q; i++)
sum+= A[i];
g << sum << endl;
}
else
{
f >> T >> V;
A[T]-= V;
}
}
f.close();
g.close();
return 0;
}