Educational Codeforces Round 83 (Rated for Div. 2) C. Adding Powers

C. Adding Powers
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output

传送门
Suppose you are performing the following algorithm. There is an array v1,v2,…,vn filled with zeroes at start. The following operation is applied to the array several times — at i-th step (0-indexed) you can:

either choose position pos (1≤pos≤n) and increase vpos by ki;
or not choose any position and skip this step.
You can choose how the algorithm would behave on each step and when to stop it. The question is: can you make array v equal to the given array a (vj=aj for each j) after some step?

Input

The first line contains one integer T (1≤T≤1000) — the number of test cases. Next 2T lines contain test cases — two lines per test case.

The first line of each test case contains two integers n and k (1≤n≤30, 2≤k≤100) — the size of arrays v and a and value k used in the algorithm.

The second line contains n integers a1,a2,…,an (0≤ai≤1016) — the array you’d like to achieve.

Output

For each test case print YES (case insensitive) if you can achieve the array a after some step or NO (case insensitive) otherwise.

Example

input

5
4 100
0 0 0 0
1 2
1
3 4
1 4 1
3 2
0 1 3
3 9
0 59049 810

output

YES
YES
NO
NO
YES

Note

In the first test case, you can stop the algorithm before the 0-th step, or don’t choose any position several times and stop the algorithm.

In the second test case, you can add k0 to v1 and stop the algorithm.

In the third test case, you can’t make two 1 in the array v.

In the fifth test case, you can skip 90 and 91, then add 92 and 93 to v3, skip 94 and finally, add 95 to v2.

思路：

最一开始我是暴力（代码1）过的，后来看到其他解法把他转换成进制问题（代码2）

代码1：

#include<iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <cmath>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <functional>
#include <ctime>
#include <iomanip>
#include <sstream>
#include <algorithm>
#define ll long long
#define PI acos(-1)
#define mes(x,y) memset(x,y,sizeof(x))
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
using namespace std;

const ll INF = 1e17 + 9;
ll n, m, k, i, j, t, x, y, z;
string s;
int main() {
	FAST_IO;
	while (cin >> k) {
		while (k--) {
			cin >> n >> m;
			ll a[100];
			for (i = 0; i < n; i++)cin >> a[i];
			sort(a, a + n);
			vector<ll>v;
			bool flag = true;
			v.push_back(1);
			ll sum = m;
			while (sum <= INF) {
				//cout << sum << endl;
				if (sum > v[v.size() - 1]) {
					v.push_back(sum);
					sum *= m;
				}
				else {
					break;
				}
			}
			map<ll, ll>mm;
			for (i = n-1; i >=0; i--) {
				if (a[i] == 0)continue;
				//cout << a[i] << ":" << endl;
				for (x = v.size() - 1; x >= 0; x--) {
					if (!mm[v[x]] && a[i] - v[x] >= 0) {
						a[i] -= v[x];
						mm[v[x]] = 1;
						//cout << v[x] << " ";
					}
					if (a[i] == 0)break;
				}
				//cout << endl << endl;
				if (a[i] > 0) {
					flag = false;
					break;
				}
			}
			if (flag)cout << "YES" << endl;
			else cout << "NO" << endl;
		}
	}
}

代码2：

#include<iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <cmath>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <functional>
#include <ctime>
#include <iomanip>
#include <sstream>
#include <algorithm>
#define ll long long
#define PI acos(-1)
#define mes(x,y) memset(x,y,sizeof(x))
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
using namespace std;

const ll INF = 1e17 + 9;
ll n, m, k, i, j, t, h, l, r;
string s;
int main() {
	FAST_IO;
	while (cin >> k) {
		while (k--) {
			cin >> n >> m;
			ll sum = 0;
			map<ll, ll>mm;
			for (i = 0; i < n; i++) {
				cin >> j;
				t = 0;
				while (j) {
					mm[t++] += j % m;
					j /= m;
				}
			}
			bool flag = true;
			for (i = 0; i < 100; i++) {
				if (mm[i] > 1) {
					flag = false;
					break;
				}
			}
			cout << (flag ? "YES" : "NO") << endl;
		}
	}
	
}