[Codeforces] Good Number

http://codeforces.com/problemset/problem/365/A

应该是 我参加cf div2比赛以来 最简单的一道题了...

 1 #include <vector>
 2 #include <cstdio>
 3 using namespace std;
 4 
 5 bool f(int num, int k) {
 6     int t = num;
 7     int arr[10] = {0};
 8     while (t) {
 9         int y = t % 10;
10         arr[y] = 1;
11         t /= 10;
12     }
13     for (int i = 0; i <= k; ++i) {
14         if (arr[i] == 0) {
15             return false;
16         }
17     }
18     return true;
19 }
20 
21 void solve(int a[], int n, int k) {
22     int cnt = 0;
23     for (int i = 0; i < n; ++i) {
24         if (f(a[i], k)) {
25             cnt += 1;
26         }
27     }
28     printf("%d\n", cnt);
29 }
30 
31 int main()
32 {
33     int n = 0, k = 0;
34     scanf("%d%d", &n, &k);
35     int arr[101] = {0};
36     for (int i = 0; i < n; ++i) {
37         scanf("%d", &arr[i]);
38     }
39     solve(arr, n, k);
40     return 0;
41 }

 

posted @ 2013-11-20 02:34  NextLife  阅读(283)  评论(0)    收藏  举报