C .Adding Powers codeforces（位运算&&思维）

最新推荐文章于 2020-08-07 17:20:37 发布

starlet_kiss

最新推荐文章于 2020-08-07 17:20:37 发布

阅读量371

点赞数

文章标签：位运算思维

本文链接：https://blog.csdn.net/starlet_kiss/article/details/104771030

版权

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
inputCopy
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
outputCopy
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.
思路：其实思路很清晰，按照位运算的思想，把每一个数字，转化成k进制数，看看总共的k进制数位上，是不是有大于1的数位，如果有，就不可能了。
代码如下：

#include<bits/stdc++.h>
#define ll long long
using namespace std;

const int maxx=31;
int ww[60];
ll a[maxx];
int n,k;

inline void fcs(int &flag)
{
	memset(ww,0,sizeof(ww));
	for(int i=1;i<=n;i++)
	{
		string s="";
		while(a[i])
		{
			int zz=a[i]%k;
			if(zz>1)
			{
				flag=0;
				break;
			}
			s=s+(char)(zz+'0');
			a[i]/=k;
		}
		if(!flag) return ;
		for(int j=0;j<s.length();j++) if(s[j]=='1') ww[j]++;
	}
}
inline bool solve()
{
	for(int i=0;i<60;i++) if(ww[i]>1) return 0;
	return 1;
}
int main()
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d%d",&n,&k);
		for(int i=1;i<=n;i++) scanf("%lld",&a[i]);
		int flag=1;
		fcs(flag);
		if (flag&&solve()) cout<<"YES"<<endl;
		else cout<<"NO"<<endl;
	}
	return 0;
}