-
Notifications
You must be signed in to change notification settings - Fork 6
/
BCTEST12-src.cpp
102 lines (89 loc) · 2.49 KB
/
BCTEST12-src.cpp
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
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
/*
* To change this license header, choose License Headers in Project Properties.
* To change this template file, choose Tools | Templates
* and open the template in the editor.
*/
import java.util.Scanner;
/**
*
* @author Cuong Nguyen
*/
public class Main {
public static int MAX = 10000;
public static boolean [] isPrime = new boolean [MAX];
public static int [] primeList = new int [5000];
public static int [] d = new int [5000];
public static int psize = 0;
public static int res;
public static void SNT() {
for (int i = 1; i < MAX; i++){
isPrime[i] = true;
}
for (int i = 2; i < MAX; i++) {
if (isPrime[i]) {
primeList[++psize] = i;
for (int j = i * i; j < MAX; j += i) {
isPrime[j] = false;
}
}
}
}
public static boolean dieuKien(int a, int b) {
if (a < 1000 || b < 1000)return false;
int d = 0;
int x, y;
while (a != 0) {
x = a % 10;
a /= 10;
y = b % 10;
b /= 10;
if (x != y) {
d++;
}
}
return (d == 1);
}
public static int BFS(String a, String b) {
int []q = new int [5000];
int u = 0;
int v = 0;
for (int i = 1; i <= psize; i++) {
if (Integer.parseInt(a) == primeList[i]){
u = i;
}
if (Integer.parseInt(b) == primeList[i]){
v = i;
}
}
for (int i = 1; i <= psize; i++) {
d[i] = MAX * 100;
}
d[u] = 0;
int l = 1, r = 1;
q[1] = u;
while (l <= r) {
int s = q[l++];
for (int t = 1; t <= psize; t++) {
if (dieuKien(primeList[s], primeList[t])
&& d[t] > d[s] + 1) {
q[++r] = t;
d[t] = d[s] + 1;
}
}
}
return d[v];
}
static void process(String a, String b) {
System.out.println(BFS(a, b));
}
public static void main(String[] args) {
SNT();
Scanner in = new Scanner(System.in);
int n = Integer.parseInt(in.nextLine());
for (int i = 0; i < n; i++) {
String a = in.next();
String b = in.next();
process(a, b);
}
}
}