For a number N, a goodArray is the smallest possible array that consists of only powers of two (20, 21 .. 24) such that the sum of all the numbers in the array is equal to N. A For each query that consists of three integers 1, r, and m, find out the product of elements goodArray[I through goodArray(r] modulo m when goodArray is sorted in non-decreasing order. Example For N= 26, queries = [I1, 2, 10091, [3, 3, 511 goodArraywhen 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, getQueryResults has the following parameters be: long N: the integer N int queries[qi[3]: a 2D array of queries, each with 3 elements (, r, and m. Return int answer g]: the answers to the queries Constraints 1 ≤ N≤1018 1$93105 1s m$ 105 1 sIsrs | goodArray|, where | goodArray/ denotes the length of the array Input Format Fer Custom Testing The first line contains an integer, N. The next line contains an integer, q, the number of queries, The next line contains the number of parameters for each query, 3, The following q lines each contain three space-separated integers (, r, and m respectively,
For a number N, a goodArray is the smallest
possible array that consists of only powers of
two (20, 21
.. 24) such that the sum of all the
numbers in the array is equal to N.
A
For each query that consists of three integers 1,
r, and m, find out the product of elements
goodArray[I through goodArray(r] modulo
m when goodArray is sorted in non-decreasing
order.
Example
For N= 26, queries = [I1, 2, 10091, [3, 3, 511
goodArraywhen 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,
getQueryResults has the following parameters be:
long N: the integer N
int queries[qi[3]: a 2D array of queries, each
with 3 elements (, r, and m.
Return
int answer g]: the answers to the queries
Constraints
1 ≤ N≤1018
1$93105
1s m$ 105
1 sIsrs | goodArray|, where | goodArray/
denotes the length of the array
Input Format Fer Custom Testing
The first line contains an integer, N.
The next line contains an integer, q, the
number of queries,
The next line contains the number of
parameters for each query, 3,
The following q lines each contain three
space-separated integers (, r, and m
respectively,
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 2 images
