Database System Concepts
7th Edition
ISBN: 9780078022159
Author: Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher: McGraw-Hill Education
expand_more
expand_more
format_list_bulleted
Related questions
Question
thumb_up100%
using java to solve this
![1. GoodArray
For a number N, a goodArray is the smallest possible array that consists of only
powers of two (20, 21 ... 2k) such that the sum of all the numbers in the array is
equal to N.
For each query that consists of three integers /, r, and m, find out the product of
elements goodArray[1] through goodArray[r] modulo m when goodArray is sorted
in non-decreasing order.
Example
For N = 26, queries = [[1, 2, 1009], [3, 3, 5]]
goodArray when sorted is [2,8,16].
For query / = 1, r = 2, m= 1009, ans = goodArray[1] *goodArray[2] = (2*8) modulo
1009 = 16.
For query / = 3, r = 3, m = 5, ans=goodArray3 = (16) modulo 5 = 1.
The answer is [16, 1].
Function Description
Complete the function getQueryResults in the editor below.
J
The answer is [16, 1].
Function Description
Complete the function getQueryResults in the editor below.
getQueryResults has the following parameters:
long N: the integer N
int queries[q][3]: a 2D array of queries, each with 3 elements I, r, and m.
Return
int answer[q]: the answers to the queries
Constraints
• 1 ≤ N≤ 1018
1≤q≤ 105
• 1≤m≤ 105
• 1≤lsrs goodArray), where I goodArray/ denotes the length of the array
► Input Format For Custom Testing
Java 15
Autocomplete Ready Ⓒ
1 > import java.io.*; ...
14
15
16
17
18
→ Info
19
20
21
22
23
24
25
26
27
28
15
16
17
18
19
20
21
22
23
24
3
26
class Result {
29
30
31
32
33 public class Solution [...
27
28
29
30
31
32
below.
*The function is expected to return an
INTEGER ARRAY.
*The function accepts following parameters:
1. LONG INTEGER n
* 2. 2D INTEGER_ARRAY queries
*/
InfoJava is
Autocomplete Ready Ⓒ
1 > import java.io.*;...
14
* Complete the 'getQueryResults' function
public static List<Integer> getQueryResults
(long n, List<List<Integer>> queries) {
// Write your code here
}
}
*
Custom In
class Result {
below.
Line: 33 Col: 24
?
/*
* Complete the 'getQueryResults' function
*The function is expected to return an
INTEGER ARRAY.
The function accepts following parameters:
* 1. LONG INTEGER n
* 2. 2D INTEGER_ARRAY queries
*/
public static List<Integer> getQueryResults
(long n, List<List<Integer>> queries) {
// Write your code here
}](https://content.bartleby.com/qna-images/question/6faa1513-1379-4588-b942-2bda461c0471/4b51e301-a9c2-4495-b031-7d099e4ca23b/i1iyuac_processed.png)
Transcribed Image Text:1. GoodArray
For a number N, a goodArray is the smallest possible array that consists of only
powers of two (20, 21 ... 2k) such that the sum of all the numbers in the array is
equal to N.
For each query that consists of three integers /, r, and m, find out the product of
elements goodArray[1] through goodArray[r] modulo m when goodArray is sorted
in non-decreasing order.
Example
For N = 26, queries = [[1, 2, 1009], [3, 3, 5]]
goodArray when sorted is [2,8,16].
For query / = 1, r = 2, m= 1009, ans = goodArray[1] *goodArray[2] = (2*8) modulo
1009 = 16.
For query / = 3, r = 3, m = 5, ans=goodArray3 = (16) modulo 5 = 1.
The answer is [16, 1].
Function Description
Complete the function getQueryResults in the editor below.
J
The answer is [16, 1].
Function Description
Complete the function getQueryResults in the editor below.
getQueryResults has the following parameters:
long N: the integer N
int queries[q][3]: a 2D array of queries, each with 3 elements I, r, and m.
Return
int answer[q]: the answers to the queries
Constraints
• 1 ≤ N≤ 1018
1≤q≤ 105
• 1≤m≤ 105
• 1≤lsrs goodArray), where I goodArray/ denotes the length of the array
► Input Format For Custom Testing
Java 15
Autocomplete Ready Ⓒ
1 > import java.io.*; ...
14
15
16
17
18
→ Info
19
20
21
22
23
24
25
26
27
28
15
16
17
18
19
20
21
22
23
24
3
26
class Result {
29
30
31
32
33 public class Solution [...
27
28
29
30
31
32
below.
*The function is expected to return an
INTEGER ARRAY.
*The function accepts following parameters:
1. LONG INTEGER n
* 2. 2D INTEGER_ARRAY queries
*/
InfoJava is
Autocomplete Ready Ⓒ
1 > import java.io.*;...
14
* Complete the 'getQueryResults' function
public static List<Integer> getQueryResults
(long n, List<List<Integer>> queries) {
// Write your code here
}
}
*
Custom In
class Result {
below.
Line: 33 Col: 24
?
/*
* Complete the 'getQueryResults' function
*The function is expected to return an
INTEGER ARRAY.
The function accepts following parameters:
* 1. LONG INTEGER n
* 2. 2D INTEGER_ARRAY queries
*/
public static List<Integer> getQueryResults
(long n, List<List<Integer>> queries) {
// Write your code here
}
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution
Trending nowThis is a popular solution!
Step by stepSolved in 2 steps
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- 7. Suppose that you have two different algorithms for solving a problem. To solve a problem of size n, the first algorithm uses exactly n(log2 n) operations and the second algorithm uses exactly n3/2 operations. As n grows, which algorithm uses fewer operations?arrow_forwardSuppose you have a computer that requires 1 minute to solve problem instance of size 210. What instance sizes can be run in 1 minute on a computer 256 times faster than the first one assuming the following complexities? (a) Θ (n2 ) (b) Θ (logn) (c) Θ ( 2n ) (d) Θ (SquareRoot(n))arrow_forwardGive the algorithm code for these examples:1. Divide2. Calculator3. Longest block of onesarrow_forward
- Given a program designed to calculate rocket trajectories, the algorithm has an O(2n) complexity and takes 1 second for each iteration, and n = 15. How many hours will it take to calculate the trajectories, worst case?arrow_forwardusing java to solve this algorithm problemarrow_forwardkindly solve this problem using pythonarrow_forward
arrow_back_ios
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON 
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education