Repository navigation
Expand file tree
/
Copy path2014_C_B.cpp
More file actions
82 lines (77 loc) · 1.49 KB
/
Copy path2014_C_B.cpp
File metadata and controls
82 lines (77 loc) · 1.49 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
#include <cstdio>
#include <iostream>
#include <unordered_set>
#include <cstring>
using namespace std;
int cnt[1000004];
void countClicks(int n, int *cnt, unordered_set<int> &nums) {
if (cnt[n] > 0) {
return;
}
if (n < 10 && nums.find(n) != nums.end()) {
cnt[n] = 1;
return;
} else if (n < 3 && nums.find(n) == nums.end()){
cnt[n] = -1;
return;
}
int tmpN = n;
int tmpCnt = 0;
while (tmpN) {
if (nums.find(tmpN%10) != nums.end()) {
tmpCnt++;
} else {
tmpCnt = -1;
break;
}
tmpN /= 10;
}
if (tmpCnt > 0) {
cnt[n] = tmpCnt;
}
for (int i = n-1; i*i >= n && i > 1; --i) {
if ((n % i) == 0) {
countClicks(n/i, cnt, nums);
countClicks(i, cnt, nums);
if (cnt[i] > 0 && cnt[n/i] > 0) {
if (cnt[n] < 0 || cnt[n] > cnt[n/i] + cnt[i]) {
cnt[n] = cnt[n/i] + cnt[i] + 1;
}
}
}
}
}
int main() {
int T, X;
cin >> T;
unordered_set<int> nums;
for (int i = 1; i <= T; ++i) {
nums.clear();
for (int j = 0; j < 10; ++j) {
int tmp;
scanf("%d", &tmp);
if (tmp == 1) {
nums.insert(j);
}
}
cin >> X;
if (X < 0) {
cout << "Case #" << i << ": Impossible" << endl;
continue;
}
memset(cnt, -1, sizeof(int)*(X+1));
/*for (int k = 0; k <= X; ++k) {
cnt[k] = -1;
}*/
countClicks(X, cnt, nums);
/*for (int i = 0; i <= X; ++i) {
printf("%d : %d\n", i, cnt[i]);
}*/
if (cnt[X] > 0) {
cout << "Case #" << i << ": " << cnt[X]+1 << endl;
} else {
cout << "Case #" << i << ": Impossible" << endl;
}
}
return 0;
}