Pagini recente » Cod sursa (job #1690259) | Cod sursa (job #1948339) | Cod sursa (job #1044235) | Cod sursa (job #1802766) | Cod sursa (job #1919613)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("datorii.in");
ofstream g("datorii.out");
int main()
{
int n,m,a[1500],b[1000][3],i,s,k;
f>>n>>m;
for(i=1;i<=n;++i)
f>>a[i];
for(i=1;i<=m;++i)
{
f>>b[i][1];
f>>b[i][2];
f>>b[i][3];
}
for(i=1;i<=m;++i)
{
if(b[i][1]==0)
a[b[i][2]]=a[b[i][2]]-b[i][3];
else
{ s=0;
for(k=b[i][2];k<=b[i][3];++k)
s+=a[k];
g<<s<<endl;
}
}
f.close();
g.close();
return 0;
}