Pagini recente » Cod sursa (job #3173558) | Cod sursa (job #984803) | Cod sursa (job #1818518) | Cod sursa (job #2757779) | Cod sursa (job #1998310)
#include <fstream>
using namespace std;
ifstream f("datorii.in");
ofstream g("datorii.out");
int sir[100001];
unsigned short int i, j;
int main(){
int n, x, y, z;
long m;
f >> n >> m;
for(i=1; i<=n; i++) f >> sir[i];
for(i=1; i<=m; i++){
f >> x >> y >> z;
if(x==1){
int s=0;
for(j=y; j<=z; j++) s+=sir[i];
g << s << '\n';
}
else sir[y]-=z;
}
return 0;
}