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