Pagini recente » Cod sursa (job #2302548) | Cod sursa (job #766007) | Cod sursa (job #2991047) | Cod sursa (job #553847) | Cod sursa (job #716951)
Cod sursa(job #716951)
#include<fstream>
using namespace std;
int n,m,A[15001];
ofstream g("datorii.out");
void monstru()
{
ifstream f("datorii.in");
f>>n>>m;
int i,a,b,c,k,x;
for(i=1;i<=n;i++)
f>>A[i];
for(i=1;i<=m;i++)
{
f>>a>>b>>c;
if(a==0)
A[b]-=c;
else
{
k=0;
for(;b<=c;b++)
k+=A[b];
g<<k<<'\n';
}
}
g.close();
}
int main(void)
{
monstru();
return 0;
}