Pagini recente » Cod sursa (job #2364736) | Cod sursa (job #1718290) | Cod sursa (job #2966570) | Cod sursa (job #136036) | Cod sursa (job #2284739)
#include<iostream>
#include<fstream>
using namespace std;
int main ()
{
ifstream fin ("datorii.in");
ofstream fout ("datorii.out");
int n, m, A[15000], i, j, k, l,s;
fin>>n>>m;
for (i=1;i<=n;i++)
fin>>A[i];
for(i=1;i<=m;i++)
{ fin>>j;
if (j==1)
{ fin>>k>>l; s=0;
for (k; k<=l;k++)
s+=A[k];
fout<<s<<endl;
}
else
{ fin>>k>>l;
A[k]=A[k]-l;
}
}
fin.close ();
fout.close ();
return 0;
}