B. Nezzar and Lucky Number

Codeforces Round #698 (Div. 2) B

B. Nezzar and Lucky Number

Nezzar’s favorite digit among 1,…,9 is d. He calls a positive integer lucky if d occurs at least once in its decimal representation.

Given q integers a1,a2,…,aq, for each 1≤i≤q Nezzar would like to know if ai can be equal to a sum of several (one or more) lucky numbers.

Input
The first line contains a single integer t (1≤t≤9) — the number of test cases.

The first line of each test case contains two integers q and d (1≤q≤104, 1≤d≤9).

The second line of each test case contains q integers a1,a2,…,aq (1≤ai≤109).

Output
For each integer in each test case, print “YES” in a single line if ai can be equal to a sum of lucky numbers. Otherwise, print “NO”.

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

Example
input
2
3 7
24 25 27
10 7
51 52 53 54 55 56 57 58 59 60
output
YES
NO
YES
YES
YES
NO
YES
YES
YES
YES
YES
YES
NO
Note
In the first test case, 24=17+7, 27 itself is a lucky number, 25 cannot be equal to a sum of lucky numbers.

linkB

分析：
①当x大于等于 d*10 时，满足情况，因可从1，2，3，4，5，6，7，8，9，0里随意组合

② 若x < d*10,此时 x 为两位数，十位数可自由组合，所以只观察个位数字，若 x 的个位数字为d的倍数，x -= d ，总会得到 x % 10 == d ，否则答案为no

代码：

#include <iostream>

using namespace std;

int main()
{
	int t;
	cin >> t;
	int n,d;
	while(t --)
	{
		cin >> n >> d;
		while(n --)
		{
			int x;
			cin >> x;
			
			if(x >= d * 10) cout << "YES" << endl;
			else
			{
				int flag = 0;
				while(x >= 0)
				{
					if(x % 10 != d)
					x -= d;
					else 
					{
						flag = 1;
						cout << "YES" << endl;
						break;
					} 
				}
			    if(flag == 0)
			    cout << "NO" << endl;
			}
		}
	}
return 0;
}