Pagini recente » Cod sursa (job #1657148) | Cod sursa (job #2703476) | Cod sursa (job #1571056) | Cod sursa (job #967039) | Cod sursa (job #1248841)
/*
datorii infoarena
*/
#include<vector>
#include<string>
#include<string.h>
#include<algorithm>
#include<cstdio>
#include<fstream>
#include<iostream>
#include<ctime>
#include<set>
#include<map>
#include<cmath>
using namespace std;
#define LL long long
#define PII pair<int ,int>
#define PCI pair<char ,int>
#define VB vector <bool>
#define VI vector <int>
#define VC vector <char>
#define WI vector<VI>
#define WC vector<VC>
#define RS resize
#define X first
#define Y second
#define FORN(i,n) for(int i=0;i<n;++i)
#define FOR(i,a,b) for(int i=a;i<=b;++i)
#define FORD(i,a,b) for(int i=a;i>=b;--i)
#define REPEAT do
#define UNTIL(x) while((x))
#define IN_FILE "datorii.in"
#define OUT_FILE "datorii.out"
ifstream f(IN_FILE);
ofstream g(OUT_FILE);
//variables
int n, m;
VI x;
//other functions
void FirstCommand(int a,int b)
{
x[a-1] -=b;
}
void SecondCommand(int a,int b)
{
LL suma = 0;
FOR(i, a - 1, b - 1)
{
suma += x[i];
}
g << suma << "\n";
}
void reading()
{
f >> n >> m;
x.RS(n);
FORN(i, n)
f >> x[i];
FORN(i, m)
{
int comanda, a, b;
f >> comanda >> a >> b;
if (comanda == 0)
FirstCommand(a,b);
else
SecondCommand(a,b);
}
f.close();
}
void solving()
{
}
void write_data()
{
}
int main()
{
reading();
solving();
write_data();
}