TOJ 3519.Ones and Zeros

题目链接:http://acm.tju.edu.cn/toj/showp3519.html


3519.    Ones and Zeros
Time Limit: 1.0 Seconds    Memory Limit: 65536K
Total Runs: 702    Accepted Runs: 395



Though numbers are created by human beings, but there are still lots of mysteries about them. For example, for a certain positive integer n and a certain system p such as decimal, hex and so on, does a positive integer m exist that it is a multiple of n and it only contains 0 and 1 in system p.
 

Input

The first line containing a integer T indicating the number of cases.
Each case has a single line with n and p.(0<= n < 1000000 , 2 <= p < 1000000)

Output

For each case, output "Yes"(m exists) or "No"(no such number) in a single line.
Input Example

Sample Input

2
4 2
3 10

Sample Output

Yes
Yes

hint: 100(2) = 4*1(10), 111(10)=3*37(10);



Source: TJU Team Selection Contest 2010 (4)


结果是都是Yes,不过证明了半天找不到头绪,就很气~~

#include <stdio.h>
int main(){
    int n,p,cas;
    scanf("%d",&cas);
    while(cas--){
        scanf("%d%d",&n,&p);
        puts("Yes");
    }

}


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值