Cod sursa(job #925058)
Utilizator | Rosca Andrei andi23rosca | Data | 24 martie 2013 13:23:37 |
---|---|---|---|
Problema | Datorii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
long int A[15000],o,N,M,T,V,P,Q,i,j,s=0;
ifstream f("datorii.in");
ofstream g("datorii.out");
f>>N>>M;
for(i=1;i<=N;i++)
{
f>>A[i];
}
for(i=1;i<=M;i++)
{
f>>o;
if(o==0)
{
f>>T>>V;
A[T]=A[T]-V;
}
else
{
f>>P>>Q;
for(j=P;j<=Q;j++)
{
s=s+A[j];
}
g<<s<<endl;;
s=0;
}
}
f.close();g.close();
return 0;
}