Pagini recente » Cod sursa (job #949862) | Cod sursa (job #2044453) | algoritmiada-2009/runda-finala/poze | Cod sursa (job #1263953)
#include<stdio.h>
struct{
int x,y,z;
}t;
int main()
{
FILE *f,*g;
f=fopen("datorii.in","r");
g=fopen("datorii.out","a");
int a[15001],n,m,s,i,j;
if(fscanf(f,"%d%d",&n,&m))
for(i=1;i<=n;i++)
{
if(fscanf(f,"%d",&a[i]));
}
for(i=0;i<m;i++)
{
if(fscanf(f,"%d%d%d",&t.x,&t.y,&t.z))
{
if(t.x==0)
a[t.y]=a[t.y]-t.z;
else
{
s=0;
for(j=t.y;j<=t.z;j++)
s=s+a[j];
if(fprintf(g,"%d\n",s));
}
}
}
fclose(f);
fclose(g);
return 0;
}