Pagini recente » Cod sursa (job #1492572) | Cod sursa (job #2943657) | Cod sursa (job #1312486) | Cod sursa (job #2246868) | Cod sursa (job #110386)
Cod sursa(job #110386)
#include <fstream.h>
int main()
{ long m,a[15001][15001];
int n,b[15001];
int i,j,x,p,q,t,v;
long k;
ifstream f("datorii.in");
ofstream g("datorii.out");
f>>n>>m;
for (i=1;i<=n;i++) f>>b[i];
for (i=1;i<=n;i++) a[i][i]=b[i];
for (i=1;i<n;i++)
for (j=i+1;j<=n;j++)
a[i][j]=a[i][j-1]+b[j];
for (k=1;k<=m;k++)
{ f>>x;
if (x==1)
{ f>>p>>q;
g<<a[p][q]<<'\n';
}
if (x==0)
{ f>>t>>v;
for (i=1;i<=t;i++)
for (j=t;j<=n;j++)
a[i][j]=a[i][j]-v;
}
}
f.close();
g.close();
return 0;
}