Pagini recente » Cod sursa (job #813708) | Monitorul de evaluare | Cod sursa (job #1093280) | Cod sursa (job #995013) | Cod sursa (job #2268453)
#include <iostream>
#include <fstream>
using namespace std;
int totalDatorii(int st, int sf, int sir[]){
int total =0;
for(int i=st-1;i<sf;i++){
total = total + sir[i];
}
return total;
}
int main()
{
ifstream fin ("datorii.in");
ofstream fout("datorii.out");
int N, M, bit, val1,val2;
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;
fout<<totalDatorii(val1,val2,A)<<endl;
}else{
fin>>val1>>val2;
A[val1-1]=A[val1-1]-val2;
}
}
return 0;
}