Cod sursa(job #2503905)
| Utilizator | Data | 3 decembrie 2019 21:51:12 | |
|---|---|---|---|
| Problema | Datorii | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | mirceaputemdadela8faraunsfert | Marime | 0.63 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("datorii.in");
ofstream g ("datorii.out");
int n, q;
int vek[15005];
int main()
{
f>>n>>q;
for(int i=1;i<=n;++i)
{
f>>vek[i];
}
for(int i=1;i<=q;++i)
{
int t;
f>>t;
if(t==0)
{
int z, v;
f>>z>>v;
vek[z]-=v;
}
else {
int p,q;
f>>p>>q;
int s=0;
for(int j=p;j<=q;++j)
{
s+=vek[j];
}
g<<s<<"\n";
}
}
return 0;
}
