Repository navigation
Expand file tree
/
Copy path11730.cpp
More file actions
85 lines (79 loc) · 1.84 KB
/
Copy path11730.cpp
File metadata and controls
85 lines (79 loc) · 1.84 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
83
84
85
/**
* ____
* ____ ___ ____ ________ __/ __/
* / __ `__ \/ __ `/ ___/ / / / /_
* / / / / / / /_/ / / / /_/ / __/
* /_/ /_/ /_/\__,_/_/ \__,_/_/
*
* @link : https://the-redback.com
*/
#include <bits/stdc++.h>
using namespace std;
#define mem(a, b) memset(a, b, sizeof(a))
#define pb push_back
#define pp pop_back
#define inf 1000000000
#define NN 1000
queue<int> q;
vector<int> e[NN + 7];
vector<int> pr;
int vis[NN + 7];
bool p[NN + 7];
void sieve(int n) {
int i, j;
p[1] = 1;
pr.push_back(2);
for (i = 4; i <= n; i += 2) p[i] = 1;
for (i = 3; i <= n; i += 2) {
if (p[i] == 0) {
pr.push_back(i);
for (j = i * i; j <= n; j += 2 * i) p[j] = 1;
}
}
}
int factor(int n) {
int k, i, r = n;
for (i = 0; i < pr.size() && pr[i] * pr[i] <= n; i++) {
k = pr[i];
if (n % k == 0) e[r].pb(k);
while (n % k == 0) n /= k;
if (n == 1) break;
}
if (n > 1 && n != r) e[r].pb(n);
}
int go(int n) {
int i, j;
sieve(n);
for (i = 1; i <= n; i++) factor(i);
}
int bfs(int src, int dist) {
mem(vis, -1);
vis[src] = 0;
q = queue<int>();
q.push(src);
while (q.size()) {
int u = q.front();
if (u == dist) return vis[u];
q.pop();
for (int i = 0; i < e[u].size(); i++) {
int v = u + e[u][i];
if (v <= 1000 && vis[v] == -1) {
vis[v] = vis[u] + 1;
q.push(v);
}
}
}
return -1;
}
int main() {
go(1000);
int tc, t = 1;
int i, j, k, l, m, n, u, v, w, res;
// scanf("%d",&tc);
while (~scanf("%d%d", &u, &v)) {
if (u == 0 && v == 0) return 0;
res = bfs(u, v);
printf("Case %d: %d\n", t++, res);
}
return 0;
}