Pagini recente » Cod sursa (job #1431148) | Cod sursa (job #838607) | Cod sursa (job #2043113) | Clasament dacanuacumatunciniciodata | Cod sursa (job #12368)
Cod sursa(job #12368)
#include <fstream.h>
#include <stdio.h>
#include <iostream.h>
long n,m,v[15001],val[15001],a;
int i,j,s,b,c;
int main()
{
ifstream f;
f.open("datorii.in",ios::in);
ofstream g;
g.open("datorii.out",ios::out);
f>>n;f>>m;val[0]=0;
for (i=1;i<=n;i++)
{f>>v[i];val[i]=val[i-1]+v[i];}
for (i=1;i<=m;i++)
{f>>a>>b>>c;
if (a) { g<<(val[c]-val[b-1])<<endl;}
else { for (j=b;j<=n;j++)
val[j]=val[j]-c;}
}
return 0;
}