Cod sursa(job #2284754)
| Utilizator | Data | 17 noiembrie 2018 15:05:36 | |
|---|---|---|---|
| Problema | Datorii | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.46 kb |
#include<iostream>
#include<fstream.h>
using namespace std;
int main ()
{
ifstream fin("datorii.in");
ofstream fout("datorii.out");
int n, m, A[15000], i, j, k, l,s[200],y=0;
fin>>n>>m;
for (i=1;i<=n;i++)
fin>>A[i];
for(i=1;i<=m;i++)
{ fin>>j;
if (j==1)
{ fin>>k>>l; s[y]=0;
for (k; k<=l;k++)
s[y]+=A[k];
y++;
}
else
{ fin>>k>>l;
A[k]=A[k]-l;
}
}
for(i=0;i<y;i++)
fout<<s[i]<<'\n';
fin.close();
fout.close();
return 0;
}
