Cod sursa(job #344463)
Utilizator | Ionescu Vlad vladii | Data | 30 august 2009 12:21:52 |
---|---|---|---|
Problema | Datorii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.71 kb |
#include <stdio.h>
using namespace std;
int main() {
int n, m, p[15000], i, j, x, y, z, s=0;
FILE *f1 = fopen("datorii.in", "r");
FILE *f2 = fopen("datorii.out", "w");
fscanf(f1, "%d%d", &n, &m);
p[0]=0;
for(i=1; i<=n; i++) {
fscanf(f1, "%d", j);
p[i]=p[i-1]+j;
}
for(i=1; i<=m; i++) {
fscanf(f1, "%d%d%d", &x, &y, &z);
if(x==0) {
//a[y]-=z;
for(j=y;j<=n;j++) { p[j]-=z; }
}
else {
s=p[z]-p[y-1];
fprintf(f2, "%d\n", s);
s=0;
}
}
fclose(f1);
fclose(f2);
return 0;
}