Cod sursa(job #1919579)
Utilizator | Data | 9 martie 2017 20:07:37 | |
---|---|---|---|
Problema | Datorii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.72 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("datorii.in");
ofstream g("datorii.out");
int n,m,a[1500],b[1000][3],i,s,k;
int main()
{
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];
}
i=1;
while(i<=m)
{
if(b[i][1]==0) {a[b[i][2]]=a[b[i][2]]-b[i][3];
++i;
}
else
{ s=0;
for(k=b[i][2];k<=b[i][3];++k)
s+=a[k];
g<<s<<endl;
++i;
}
}
return 0;
}