Pagini recente » Cod sursa (job #2500142) | Cod sursa (job #2740870) | Cod sursa (job #1180057) | Cod sursa (job #268086) | Cod sursa (job #1722400)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("datorii.in");
ofstream fout("datorii.out");
struct nod
{
int info;
nod *adr;
};
int n,m,j,t,q,p,v,s,binar;
nod *prim,*a,*ultim;
int main()
{
fin>>n>>m;
prim=new nod;
fin>>prim->info;
prim->adr=NULL;
ultim=prim;
int i;
for(i=2;i<=n;i++)
{
a=new nod;
fin>>a->info;
a->adr=NULL;
ultim->adr=a;
ultim=a;
}
for(j=1;j<=m;j++)
{
fin>>binar>>p>>q;
if(binar==0)
{
a=prim;
for(i=2;i<=p;i++)
a=a->adr;
a->info=a->info-q;
}
else
{
a=prim;
for(i=2;i<=p;i++)
a=a->adr;
s=a->info;
for(i=p+1;i<=q;i++)
{
a=a->adr;
s=s+a->info;
}
fout<<s;
fout<<"\n";
}
}
fin.close();
fout.close();
return 0;
}