1 solutions
-
0
C :
#include"stdio.h" int main() { int N,M; scanf("%d %d",&N,&M); int an[N],i; for(i=0;i<N;i++) scanf("%d",&an[i]); while(M--) { int a,b,s=0; scanf("%d%d",&a,&b); for(i=a-1;i<b;i++) s=s+an[i]; printf("%d\n",s); } return 0; }C++ :
#include<stdio.h> int main() { int N,M,i,a[105],m,n; scanf("%d%d",&N,&M); for(i=1;i<=N;i++) scanf("%d",&a[i]); while(M--) { int sum=0; scanf("%d%d",&m,&n); for(i=m;i<=n;i++) sum+=a[i]; printf("%d\n",sum); } return 0; }Pascal :
var q,w,e,r,t:longint; a:array[1..1000000] of longint; b,c,d:array[1..100000]of longint; begin read(q,w); for e:=1 to q do read(a[e]); for e:=1 to w do read(b[e],c[e]); for e:=1 to w do for r:=b[e] to c[e] do d[e]:=d[e]+a[r]; for e:=1 to w do writeln(d[e]); end.Java :
import java.util.Scanner; public class Main { static Scanner sc=new Scanner(System.in); static int N=sc.nextInt(); static int M=sc.nextInt(); static int arr[]=new int[N+1]; public static void main(String[] args) { for(int i=1;i<N+1;i++) { arr[i]=sc.nextInt(); } arr[0]=-1; getSum(M); } public static void getSum(int a) { while(a-->0) { int m=sc.nextInt(); int n=sc.nextInt(); int sum=0; for(int i=m;i<=n;i++) { sum+=arr[i]; } System.out.println(sum); } } }
Information
- ID
- 20232
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- 10
- Tags
- # Submissions
- 1
- Accepted
- 1
- Uploaded By