Pagini recente » Cod sursa (job #1551955) | Cod sursa (job #234551) | Cod sursa (job #1917522) | Cod sursa (job #2182654) | Cod sursa (job #2268462)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream fin ("datorii.in");
ofstream fout("datorii.out");
int N, M, bit, val1,val2,total;
fin >> N >> M;
int A[N];
for(int i=0;i<N;i++){
fin >> A[i];
}
for(int i=0;i<M;i++){
fin >> bit;
if( 1 == bit){
fin>>val1>>val2;
total =0;
for(int j=val1-1;j<val2;j++){
total = total + A[j];
}
fout<<total<<"\n";
}else{
fin>>val1>>val2;
A[val1-1]=A[val1-1]-val2;
}
}
return 0;
}