Write a c++ program to solve this problem in pictures below Lab7 - Arrays QuestionsArray QueriesProblemSubmissionsTeacher solutionse Challenge taskFor a given set of N integers, you were askedto find the sum of all elements in a certainrange (L to R) where|(1 <= L <=R <= N) where 1 represents thefirst number and N is the last number.For example, if we have N=5 numbers 2 317 9, and you were asked to find the sumfrom 2 to 4.Then the sum=3+1+7=11.You should write a program to solve thisset of multiple rangesproblem for a(queries).Conotreinte Constraints1 <= L<=R <= N1<= N <=10000Q <= 1000ali) <= 1000000000S Input FormatLine1: 2 integers N and Q, represents tOlength of the array and the numberqueries respectivelyLine2: N integers represents the set of theelements a[il'sThe next Q lines are the queries where eachquery has 2 integers L and RE Output FormatO lines such that for each query you needprint the sum on a separate lineO Sample #1Input5612345132355451514Output691510O Sample #2Input104-5 96 -1000 23 63 12 1200 78 96 3019261536Output563-806-823-902" Raise Your hand!

The code and the output is given in step 2.

For a given set of N integers, you were asked to find the sum of all elements in a certain range (L to R) where (1 <= L <=R <= N) where 1 represents the first number and N is the last number. For example, if we have N=5 numbers 2 31 7 9, and you were asked to find the sum from 2 to 4. Then the sum33+1+7=11. You should write a program to solve this problem for a set of multiple ranges (queries).

For a given set of N integers, you were asked to find the sum of all elements in a certain range (L to R) where (1 <= L <=R <= N) where 1 represents the first number and N is the last number. For example, if we have N=5 numbers 2 31 7 9, and you were asked to find the sum from 2 to 4. Then the sum33+1+7=11. You should write a program to solve this problem for a set of multiple ranges (queries).

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter8: Arrays

Section: Chapter Questions

Problem 9PE

See similar textbooks

Similar questions

Rooks on a rampage def safe_squares_rooks(n, rooks): A generalized n-by-n chessboard has been invaded by a parliament of rooks, each rook represented as a two-tuple (row, column) of the row and the column of the square that the rook is in. Since we are again computer programmers instead of chess players and other normal folks, our rows and columns are numbered from 0 to n - 1. A chess rook covers all squares that are in the same row or in the same column. Given the board size n and the list of rooks on that board, count the number of empty squares that are safe, that is, are not covered by any rook. To achieve this in reasonable time and memory, you should count separately how many rows and columns on the board are safe from any rook. Because permuting the rows and columns does not change the answer to this question, you can imagine all these safe rows and columns to have been permuted to form an empty rectangle at the top left corner of the board. The area of that safe rectangle is…
Count consecutive summers def count_consecutive_summers(n): Like a majestic wild horse waiting for someone to come and tame it, positive integers can be broken down as sums of consecutive positive integers in various ways. For example, the integer 42 often used as placeholder in this kind of discussions can be broken down into such a sum in four different ways: (a) 3 + 4 + 5 + 6 + 7 + 8 + 9, (b) 9 + 10 + 11 + 12, (c) 13 + 14 + 15 and (d) 42. As the last solution (d) shows, any positive integer can always be trivially expressed as a singleton sum that consists of that integer alone. Given a positive integer n, determine how many different ways it can be expressed as a sum of consecutive positive integers, and return that count. The count of how many different ways a positive integer n can be represented as a sum of consecutive integers is also called its politeness, and can be alternatively computed by counting how many odd divisors that number has. However, note that the linked…
Count consecutive summers def count_consecutive_summers(n): Like a majestic wild horse waiting for the rugged hero to tame it, positive integers can be broken down as sums of consecutive positive integers in various ways. For example, the integer 42 often used as placeholder in this kind of discussions can be broken down into such a sum in four different ways: (a) 3 + 4 + 5 + 6 + 7 + 8 + 9, (b) 9 + 10 + 11 + 12, (c) 13 + 14 + 15 and (d) 42. As the last solution (d) shows, any positive integer can always be trivially expressed as a singleton sum that consists of that integer alone. Given a positive integer n, determine how many different ways it can be expressed as a sum of consecutive positive integers, and return that count. The number of ways that a positive integer n can be represented as a sum of consecutive integers is called its politeness, and can also be computed by tallying up the number of odd divisors of that number. However, note that the linked Wikipedia de0inition…
#include <mpi.h> int *Random_Num_Generator(int Num_Elements); int Compute_Product(int *array, int num_elements); int main(int argc, char* argv[]) { int comm_sz, my_rank;int i, Result; int Num_Per_Proc = atoi(argv[1]); // Seed the random number generator to get different results each time srand(time(NULL)); MPI_Init(&argc, &argv); MPI_Comm_rank(MPI_COMM_WORLD, &my_rank); MPI_Comm_size(MPI_COMM_WORLD, &comm_sz); // Generate a random array of elements on process 0int *Random_Nums = NULL; if (my_rank == 0){ Random_Nums = Random_Num_Generator(Num_Per_Proc * comm_sz); printf("The random numbers generated: \n"); for (i = 0; i < Num_Per_Proc * comm_sz; i++) printf("%d; ", Random_Nums[i]); printf("\n");} // Generate a buffer for holding a subset of the entire array int *Sub_Random_Nums = (int *)malloc(sizeof(int) * Num_Per_Proc); // Scatter the random integer numbers from process 0 to all processes MPI_Scatter(Random_Nums,…
CodeWorkout Gym Course Search exercises... Q Search kola_shreya@columbusstate.edu X173: array220 Given an array of int 5, compute recursively if the array contains somewhere a value followed immediately by that same value times 10. We'll use the convention of considering only the part of the array that begins at the given index.In this way, a recursive call can pass index + 1 to move down the array. The initial call will pass in an index position of 0. Your Answer: 1 public boolean array220(int[] nums, int index) 4} Check my answer! Reset Next exercise Feedbacz CodeWorkout © Virginia Tech About License Privacy Contact H 2 M 45
Java Programming
Multi Dimensional Arrays in C Program Ask the user for the number of rows and columns of a two-dimensional array and then its integer elements. Then, ask the user for another integer value which represents a boogeyman. A boogeyman is a value that we intend to find from a given array. Find and output the coordinates of the boogeyman by this format: "BOOGEYMAN LOCATED AT ROW {row_number}, COLUMN {column_number}!" Input 1. One line containing an integer for the number of rows 2. One line containing an integer for the number of columns 3. Multiple lines containing at least one integer each line for the elements of the array Sample 1 4 2 3 9 1 2 3 4 2 1 1 9 2 8 3 4. One line containing an integer for the boogeyman's value Output Print the row of the position first and then the column of the position. Note that the row and the column is 0-based (i.e. it starts at 0 and not at 1). It is guaranteed that the boogeyman exists and only once in the 2D array. Enter# of rows: 4 Enter…
int A[3] [4]={{ 4, 6, 7, 9},{ 1, 3, 4, 3},{-5, 6, 7, 2}}; int sum, row, col; sum = 0; for (col=0;col<=3;i++) sum+=A[0] [col]; what is the value of sum calculated the number of elements on row 0 the total addition of elements on row 0 the total addition of first 3 elements on row 0 the total addition of all the elements
euclids algorithm tracing
For an array declartion of int number [25];, what will be the ending index? 0 1 24 25
Arithmetic progression def arithmetic_progression(items): An arithmetic progression is a numerical sequence so that the stride between each two consecutive elements is constant throughout the sequence. For example, [4, 8, 12, 16, 20] is an arithmetic progression of length 5, starting from the value 4 with a stride of 4.Given a non-empty list items of positive integers in strictly ascending order, find and return the longest arithmetic progression whose all values exist somewhere in that sequence. Return the answer as a tuple (start, stride, n) of the values that define the progression. To ensure unique results to facilitate automated testing, if there exist several progressions of the same length, this function should return the one with the lowest start. If several progressions of equal length emanate from the lowest start, return the progression with the smallest stride. items Expected result [42] (42, 0, 1) [2, 4, 6, 7, 8, 12, 17] (2, 2, 4) [1, 2, 36, 49, 50, 70, 75, 98,…
Arithmetic progression def arithmetic_progression(items): An arithmetic progression is a numerical sequence so that the stride between each two consecutive elements is constant throughout the sequence. For example, [4, 8, 12, 16, 20] is an arithmetic progression of length 5, starting from the value 4 with a stride of 4. Given a non-empty list items of positive integers in strictly ascending order, find and return the longest arithmetic progression whose all values exist somewhere in that sequence. Return the answer as a tuple (start, stride, n) of the values that define the progression. To ensure unique results to facilitate automated testing, if there exist several progressions of the same length, this function should return the one with the lowest start. If several progressions of equal length emanate from the lowest start, return the progression with the smallest stride. items expected results [42] (42, 0, 1) [2, 4, 6, 7, 8, 12, 17] (2, 2, 4) [1, 2, 36, 49, 50, 70, 75, 98,…