Pagini recente » Cod sursa (job #1092688) | Cod sursa (job #543410) | Cod sursa (job #2873813) | Cod sursa (job #2418316) | Cod sursa (job #31534)
Cod sursa(job #31534)
#include<fstream.h>
int n, a[15000], v, t, p, q, ok;
long m;
int main()
{
int j, s;
long i;
ifstream in("datorii.in");
ofstream out("datorii.out");
in>>n>>m;
for (j=1; j<=n; j++)
in>>a[j];
for (i=1; i<=m; i++)
{
in>>ok;
if(ok)
{ s=0;
in>>p>>q;
for (j=p; j<=q; j++)
s+=a[j];
out<<s<<"\n";
}
else if (!ok)
{
in>>t>>v;
a[t]-=v;
}
}
in.close();
out.close();
return 0;
}