C. Adding Powers

链接：https://codeforces.ml/contest/1312/problem/C

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

either choose position pospos (1≤pos≤n1≤pos≤n) and increase vposvpos by kiki;
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 vv equal to the given array aa (vj=ajvj=aj for each jj) after some step?

Input

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

The first line of each test case contains two integers nn and kk (1≤n≤301≤n≤30, 2≤k≤1002≤k≤100) — the size of arrays vv and aa and value kk used in the algorithm.

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

Output

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

Example

input

Copy

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

Copy

YES
YES
NO
NO
YES

Note

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

In the second test case, you can add k0k0 to v1v1 and stop the algorithm.

In the third test case, you can't make two 11 in the array vv.

In the fifth test case, you can skip 9090 and 9191, then add 9292 and 9393 to v3v3, skip 9494 and finally, add 9595 to v2v2.

代码：

#include<bits/stdc++.h>
using namespace std;
long long t,n,k,p,s,ans;
long long a[101],v[101];
int main()
{cin>>t; while(t--){cin>>n>>k;s=n;ans=0;for(int i=1;i<=n;i++){cin>>a[i];}sort(a+1,a+1+n);int flag=1;while(a[n]){ans=0;for(int i=1;i<=n;i++){if(a[i]%k==1&&ans==0){ans++;a[i]--;a[i]/=k;}else if(a[i]%k==1){flag=0;break;}else if(a[i]%k==0){a[i]/=k;}else{flag=0;break;}}if(flag==0)break; }if(flag==0)cout<<"NO"<<endl;elsecout<<"YES"<<endl;}
}

C. Adding Powers相关推荐

CodeForces - 1312C Adding Powers(思维+位运算)
题目链接:点击查看题目大意:给出大小为 n 的一个数组 a 和一个数字 K,每个位置起始时为 0 ,现在从 i = 0 开始递增,我们能够进行如下操作: 选取 pos ∈ [ 1 , n ] 作为数 ...
C .Adding Powers codeforces（位运算思维）
outputstandard output Suppose you are performing the following algorithm. There is an array v1,v2,-, ...
【深入理解计算机系统】一：数值表示与编码
本课程内容来自于悉尼大学ELEC1601:introduction to the computer system 2.1. Binary Logic The digital electronic ci ...
Educational codeforces round 83 div2C(类似进制转换，等比数列又一个性质)
C. Adding Powers 原题目地址题意: 给你一个目标数组,要你对一个所有元素从0开始的数组进行一种操作. 每一步可以对一个元素增加 k^i ( i 为每一步)( i 可以为0) 或者 ...
android.util.AndroidRuntimeException: requestFeature() must be called before adding content
问题 Caused by: android.util.AndroidRuntimeException: requestFeature() must be called before adding co ...
UVA 10515 - Powers Et Al.(数论)
UVA 10515 - Powers Et Al. 题目链接题意:求出m^n最后一位数思路:因为m和n都非常大,直接算肯定是不行的,非常easy想到取最后一位来算,然后又非常easy想到最后一位不 ...
R语言ggplot2可视化、在可视化区域中自定义添加多个大小不同矩形阴影区域、自定义配置大小不同矩形阴影区域的颜色（Adding multiple shadows/rectangles）
R语言ggplot2可视化.在可视化区域中自定义添加多个大小不同矩形阴影区域.自定义配置大小不同矩形阴影区域的颜色(Adding multiple shadows/rectangles) 目录
R语言在可视化图像中添加文本(Adding Text to plot)
R语言在可视化图像中添加文本(Adding Text to plot) 创建一个好的可视化包括引导读者,使用图形讲述一个直观的故事.在某些情况下,这个故事可以以完全直观生动的方式呈现,而不需要添加文本 ...
SAP WM中阶之存储类型上架策略I(Adding to existing stock)
SAP WM中阶之存储类型上架策略I(Adding to existing stock) SAP WM模块里,有很多上架策略.Adding to existing stock是一种常用的上架策略.这种 ...

C. Adding Powers

C. Adding Powers相关推荐

最新文章

热门文章