You Cant See Me
All submissions for this problem are available.
You have the series:
Given a left index L and a right index R as query, output A[L] + A[L+1] + .. + A[R].
First line will contain a single integer Q, number of queries. Next Q lines will contain two space separated integers L and R.
Output single line for every test case giving sum of numbers in the range L to R inclusive.
1 <= Q <= 105
1 <= L <= R <= 105
All the Best!☺
|Time Limit:||1 sec|
|Source Limit:||50000 Bytes|
|Languages:||C, JAVA, GO|
Fetching successful submissions
If you are still having problems, see a sample solution here.