IN C++ You have given an array aa of length n and an integer x to a brand new robot. What the robot does is the following: it iterates over the elements of the array, let the current element be q. If q is divisible by x, the robot adds x copies of the integer q/x to the end of the array, and moves on to the next element. Note that the newly added elements could be processed by the robot later. Otherwise, if q is not divisible by x, the robot shuts down. Please determine the sum of all values of the array at the end of the process. Input The first input line contains a single integer tt (lâ%oatâ%o¤100) â€" the number of test cases. The first line of each test case contains two integers n and x (lâ%oanâ%o¤10^5, 2â%o¤xâ% ¤10^9) â€" the length of the array and the value which is used by the robot. The next line contains integers al, a2, ., an (lâ%o¤aiâ%o¤10^9) â€" the initial values in the array. It is guaranteed that the sum of values n over all test cases does not exceed 10^5 Output For each test case output one integer â€" the sum of all elements at the end of the process. Example input 1682 output Note In the first test case the array initially consists of a single element [12], and x=2. After the robot processes the first element, the array becomes [12,6,6]. Then the robot processes the second element, and the array becomes [12,6,6,3,3]. After the robot processes the next element, the array becomes [12,6,6,3,3,3,3], and then the robot shuts down, since it encounters an element that is not divisible by x-2. The sum of the elements in the resulting array is equal to 3636. In the second test case the array initially contains integers [4,6,8,2], and x=2 The resulting array in this case looks like [4,6,8,2,2,2,3,3,4,4,1,1,1,1,1,1].

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Question

Transcribed Image Text:IN C++ You have given an array aa of length n and an integer x to a brand new robot. What the robot does is the following: it iterates over the elements of the array, let the current element be q. If q is divisible by x, the robot adds x copies of the integer q/x to the end of the array, and moves on to the next element. Note that the newly added elements could be processed by the robot later. Otherwise, if q is not divisible by x, the robot shuts down. Please determine the sum of all values of the array at the end of the process. Input The first input line contains a single integer tt (lâ%oatâ%o¤100) â€" the number of test cases. The first line of each test case contains two integers n and x (1â%o¤nâ%o010^5, 2â%oaxâ%o ¤10^9) â€" the length of the array and the value which is used by the robot. The next line contains integers al, a2, .., an (lâ%o¤aiâ%o¤1O^9) â€" the initial values in the array. It is guaranteed that the sum of valuesn over all test cases does not exceed 10^5 Output For each test case output one integer â€" the sum of all elements at the end of the process. Example input 12 42 4682 output 36 44 Note In the first test case the array initially consists of a single element [12], and x32. After the robot processes the first element, the array becomes [12,6,6]. Then the robot processes the second element, and the array becomes [12,6,6,3,3]. After the robot processes the next element, the array becomes [12,6,6,3,3,3,3], and then the robot shuts down, since it encounters an element that is not divisible by x=2. The sum of the elements in the resulting array is equal to 3636. In the second test case the array initially contains integers [4,6,8,2], and x=2 The resulting array in this case looks like [4,6,8,2,2,2,3,3,4,4,1,1,1,1,1,1].

Expert Solution