codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

1471B.md (2126B)


      1 Source: https://codeforces.com/problemset/problem/1471/B
      2 
      3 B. Strange List
      4 
      5 time limit per test
      6 
      7 1 second
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 You have given an array $a$ 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 $\frac{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.
     22 
     23 Please determine the sum of all values of the array at the end of the process.
     24 
     25 Input
     26 
     27 The first input line contains a single integer $t$ ($1 \leq t \leq 100$) — the number of test cases.
     28 
     29 The first line of each test case contains two integers $n$ and $x$ ($1 \leq n \leq 10^5$, $2 \leq x \leq 10^9$) — the length of the array and the value which is used by the robot.
     30 
     31 The next line contains integers $a_1$, $a_2$, ..., $a_n$ ($1 \leq a_i \leq 10^9$) — the initial values in the array.
     32 
     33 It is guaranteed that the sum of values $n$ over all test cases does not exceed $10^5$.
     34 
     35 Output
     36 
     37 For each test case output one integer — the sum of all elements at the end of the process.
     38 
     39 Example
     40 
     41 Input
     42 
     43 ```
     44 2
     45 1 2
     46 12
     47 4 2
     48 4 6 8 2
     49 ```
     50 
     51 Output
     52 
     53 ```
     54 36
     55 44
     56 ```
     57 
     58 Note
     59 
     60 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 $36$.
     61 
     62 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]$.