Pagini recente » Cod sursa (job #3186964) | Cod sursa (job #2800319) | Cod sursa (job #962435) | Cod sursa (job #1911197) | Cod sursa (job #253306)
Cod sursa(job #253306)
# include <fstream>
using namespace std;
int main ()
{
int n, m, a[15005], o, o1, o2, i, j, r, d[15005][4];
ifstream fin ("datorii.in");
ofstream fout ("datorii.out");
fin>>n>>m;
for (i=1;i<=n;i++)
fin>>a[i];
for (i=1;i<=m;i++)
for (j=1;j<=3;j++)
fin>>d[i][j];
for (i=1;i<=m;i++)
{
if (d[i][1]==1)
{
r=0;
for (j=d[i][2];j<=d[i][3];j++)
r+=a[j];
fout<<r<<endl;
}
else
a[d[i][2]]-=d[i][3];
}
return 0;
}