Simple Adjacency Maximization
Problem Number:
11 532
Type of Problem:
Problem Category:
Input:
Random Input
0
0
Critical Input:
Random Input:
50
27 15
12 27
40 9
13 26
11 18
17 29
12 23
29 2
22 8
19 17
43 6
21 19
15 20
13 26
6 23
12 20
5 25
36 5
13 7
14 17
34 14
43 0
37 8
3 1
32 10
26 18
17 1
47 2
2 6
1 30
31 17
9 27
17 6
47 3
6 33
19 24
28 21
3 19
20 18
8 15
46 1
21 5
14 28
41 0
43 0
34 14
24 14
37 6
27 15
9 36
Problem Description Link:
Problem Analysis Link:
Problem Id:
11532
