Strange List

Strange List

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 qx 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 t (1≤t≤100) — the number of test cases.

The first line of each test case contains two integers n and x (1≤n≤105, 2≤x≤109) — the length of the array and the value which is used by the robot.

The next line contains integers a1, a2, …, an (1≤ai≤109) — the initial values in the array.

It is guaranteed that the sum of values n over all test cases does not exceed 105.

Output
For each test case output one integer — the sum of all elements at the end of the process.
Example
Input
2
1 2
12
4 2
4 6 8 2
Output
36
44
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 36.

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].
个人翻译
给定一个由n个数字组成的数组以及一个x。现在从前往后遍历数组，若当前遍历的数字a[i]可以被x整除，那么就在数组的最后加上x个数字a[i]/x；若当前遍历的数字不能被x整除，那么就停止遍历。遍历完这个数组过后，这个数组的总和等于多少？
个人写的代码

#include <iostream>
#define maxn 100005

using namespace std;

int main()
{
    int t,n,x;
    int a[maxn];
    cin>>t;
    while(t--){
        cin>>n>>x;
        for(int i=0;i<n;i++){
            cin>>a[i];
        }
        long long sum=0,temp=1;
        bool flag=true;
        while(flag){
            for(int i=0;i<n;i++){
                if(a[i]%temp==0){
                    sum+=a[i];
                }
                else{
                    flag=false;
                    break;
                }
            }
            temp*=x;
        }
        cout<<sum<<endl;
    }
    return 0;
}