I really need help with this question, I can’t fail this please :) tysm
1 answer:
You might be interested in
Using the knowledge in computational language in python it is possible to write a code that smallest possible array that consists of only powers of two.
<h3>Writting the code in python:</h3><em>"public class GoodArray {"</em>
<em />
<em> "public static List<Integer> getQueryResults(long N, List<List<Integer>> queries) {"</em>
<em />
<em> "List<Integer> res = new ArrayList<>();"</em>
<em> int[][] arr = new int[queries.size()][3];</em>
<em> "List<Integer> goodArray = new ArrayList<>();"</em>
<em> "for (int i = 1; i <= N; i++) {"</em>
<em> "int num = i;"</em>
<em> "while (num % 2 == 0) {"</em>
<em> "goodArray.add(num);"</em>
<em> "num = num / 2;"</em>
<em> }</em>
<em> }</em>
<em> int index = 0;</em>
<em> for (List<Integer> l : queries) {</em>
<em> arr[index][0] = l.get(0);</em>
<em> arr[index][1] = l.get(1);</em>
<em> arr[index][2] = l.get(2);</em>
<em> index++;</em>
<em> }</em>
<em> Collections.sort(goodArray);</em>
<em> "for (int i = 0; i < arr.length; i++) {"</em>
<em> "int[] query = arr[i];"</em>
<em> int l = query[0];</em>
<em> int r = query[1];</em>
<em> int m = query[2];</em>
<em> int prod = 1;</em>
<em> "for (int j = l - 1; j <= r - 1; j++) {"</em>
<em> "prod = (int) (prod * goodArray.get(j)) % m;"</em>
<em> }</em>
<em> res.add(prod);</em>
<em> }</em>
<em> return res;</em>
<em> }</em>
<em />
<em>}</em>
See more about python at brainly.com/question/18502436
#SPJ1
