A9196. Good Number
编程题
普及/提高-
知识点
题目描述
Let's call a number $k$ -good if it contains all digits not exceeding $k$ ( $0,...,k$ ). You've got a number $k$ and an array $a$ containing $n$ numbers. Find out how many $k$ -good numbers are in $a$ (count each number every time it occurs in array $a$ ).
输入格式
The first line contains integers $n$ and $k$ ( $1<=n<=100$ , $0<=k<=9$ ). The $i$ -th of the following $n$ lines contains integer $a_{i}$ without leading zeroes ( $1<=a_{i}<=10^{9}$ ).
输出格式
Print a single integer — the number of $k$ -good numbers in $a$ .
输入输出样例
输入 #1
10 6 1234560 1234560 1234560 1234560 1234560 1234560 1234560 1234560 1234560 1234560
输出 #1
10
输入 #2
2 1 1 10
输出 #2
1