codeforce 1478B B. Nezzar and Lucky Number 找规律打表 C

https://codeforces.com/contest/1478/problem/B

B. Nezzar and Lucky Number time limit per test 1 second memory limit per test 512 megabytes input standard input output standard output

Nezzar's favorite digit among

Given

Input

The first line contains a single integer

The first line of each test case contains two integers

The second line of each test case contains

Output

For each integer in each test case, print "YES" in a single line if

You can print letters in any case (upper or lower).

Example input Copy

2
3 7
24 25 27
10 7
51 52 53 54 55 56 57 58 59 60

output Copy

YES
NO
YES
YES
YES
NO
YES
YES
YES
YES
YES
YES
NO

Note

In the first test case,

#include 
#include 
#include 
#include 
#include 
#include <string.h>
#include 
#include 
#include <string>
#include 
#include 
#include 
#include 
#include 
#include 
#include <set>
#include 
#include 
#include <string.h>
#include 
#define sf scanf
#define pf printf
#define lf double
#define p123 printf("123\n");
#define pn printf("\n");
#define pk printf(" ");
#define p(n) printf("%d",n);
#define pln(n) printf("%d\n",n);
#define s(n) scanf("%d",&n);
#define ss(n) scanf("%s",n);
#define ps(n) printf("%s",n);
#define sld(n) scanf("%lld",&n);
#define pld(n) printf("%lld",n);
#define slf(n) scanf("%lf",&n);
#define plf(n) printf("%lf",n);
#define sc(n) scanf("%c",&n);
#define pc(n) printf("%c",n);
#define gc getchar();
#define ll long long
#define re(n,a) memset(n,a,sizeof(n));
#define len(a) strlen(a)
#define eps 1e-13
#define zero(x) (((x) > 0? (x):(-x)) < eps)
using namespace std;

int temp[15][20000];
int main(){
    int t;
    s(t)
    re(temp,0);
    for(int i = 1; i<= 10000; i ++){
        temp[1][i] = 1;
    }
    for(int i = 2; i <= 9; i ++){
        for(int j = 1; j <= 30; j ++){
            for(int k = 0; k <= 30; k ++){
                temp[i][i*j+k*10] = 1;
            }
        }
    }
    while(t --){
        int n,d;
        s(n) s(d)
        int x;
        for(int i = 0; i < n; i ++){
            s(x)
            if(x >= d*10){
                puts("YES");
            }else if(temp[d][x] == 1){
                puts("YES");
            }else{
                puts("NO");
            }

        }


    }
    return 0;
}

ACM

codeforce 1478B B. Nezzar and Lucky Number 找规律打表 C

相关

acm讲解

「acmhdu - 6314」Matrix

第十三届河南省ACM-ICPC游记

ACM模板

Hyperf 接入阿里云ACM应用配置管理中心

[ACM] BFS & 双端BFS & A* & 双边BFS

计算几何 / Geometry（ACM-Template 2.0）

ACM入门方式

Linux 下使用 acme.sh 配置 Let's Encrypt 免费 SSL 证书 + 通配符证书

如何写好一篇高质量的IEEE/ACM Transaction级别的计算机科学论文?

ACM- java在acm中的快速读入，多组读入，快速输出模板

ACM - 动态规划 - P1282 多米诺骨牌

标签

codeforce 1478B B. Nezzar and Lucky Number 找规律 打表 C

相关

codeforce 1478B B. Nezzar and Lucky Number 找规律打表 C