Codeforces Round #698 (Div. 2) B. Nezzar and Lucky Number

B：​​http://codeforces.com/contest/1478/problem/B​​

题意：

给你一个 

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<map>
using namespace std;
const int maxn  = 2e5+50;
const int inf=99999999;
typedef long long ll;
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int n,d;
        cin>>n>>d;
        ll x;
        while(n--)
        {
            cin>>x;
            int ok  =  0 ; 
            if(d==1)
            {
                cout<<"YES"<<endl;continue;
            }
            if(x%d==0)
            {
                cout<<"YES"<<endl;continue;
            }
            ll cha =  x-(x/d)*d;
            ll chu = x/d;
            ll sum =cha ;
            for(int i=1;i<=chu;i++)
            {                
                sum+=d;
            //    cout<<d<<"-"<<i<<endl;
                ll mdsum=sum;
                while(mdsum)
                {
                    
                    ll md=mdsum%10;
                //    cout<<md<<"--"<<mdsum<<endl;
                    mdsum=mdsum/10;
                    if(md==d)
                    {
                        ok=1;
                        break;
                    }
                }
                if(ok)
                    break;
            }
            if(ok)
                cout<<"YES"<<endl;
            else
                cout<<"NO"<<endl;
        }
    }
    return 0;    
}
//ababab