Ultraviolet A 567-Risk (Floyd)

Question:

Risk
Risk is a board game in which several opposing players attempt to conquer the world. the gameboard consists of a world map broken up into hypothetical countries. during a player's turn, armies stationed in one country are only allowed to attack only countries with which they share a common border. upon conquest of that country, the armies may move into the newly conquered country.

During the course of play, a player often engages in a sequence of conquests with the goal of transferring a large mass of armies from some starting country to a destination country. typically, one chooses the intervening countries so as to minimize the total number of countries that need to be conquered. given a description of the gameboard with 20 countries each with between 1 and 19 connections to other countries, your task is to write a function that takes a starting country and a destination country and computes the minimum number of countries that must be conquered to reach the destination. you do not need to output the sequence of countries, just the number of countries to be conquered including the destination. for example, if starting and destination countries are neighbors, then your program shocould return one.

The following connection dimo-strates the first sample input.

Input
Input to your program will consist of a series of country configuration test sets. each test set will consist of a board description on lines 1 through 19. the representation avoids listing every national boundary twice by only listing the fact that country I borders country J when I <J. thus, the Ith line, where I is less than 20, contains an integer X indicating how to handle ''hiher-numbered "countries share borders with country I, then X distinct integers J greater than I and not exceeding 20, each describing a boundary between countries I and J. line 20 of the test set contains a single integer () indicating the number of country pairs that follow. the next N lines each contain exactly two integers () indicating the starting and ending countries for a possible conquest.

There can be multiple test sets in the input file; your program shocould continue reading and processing until reaching the end of file. there will be at least one path between any two given countries in every country configuration.
Output
For each input set, your program shocould print the following message ''test Set # T "where T is the number of the Test set starting with 1 (left-justified starting in column 11 ).
The next NT lines each will contain the result for the corresponding test in the test set-that is, the minimum number of countries to conquer. the test result line shoshould contain the start country code A right-justified in columns 1 and 2; the string ''to" in columns 3 to 6; the destination country code B right-justified in columns 7 and 8; the string '':" in columns 9 and 10; and a single integer indicating the minimum number of moves required to traverse from country A to country B in the test set left-justified starting in column 11. following all result lines of each input set, your program shocould print a single blank line.
Sample Input
1 3
2 3 4
3 4 5 6
1 6
1 7
2 12 13
1 8
2 9 10
1 11
1 11
2 12 17
1 14
2 14 15
2 15 16
1 16
1 19
2 18 19
1 20
1 20
5
1 20
2 9
19 5
18 19
16 20
4 2 3 5 6
1 4
3 4 10 5
5 10 11 12 19 18
2 6 7
2 7 8
2 9 10
1 9
1 10
2 11 14
3 12 13 14
3 18 17 13
4 14 15 16 17
0
0
0
2 18 20
1 19
1 20
6
1 20
8 20
15 16
11 4
7 13
2 16
Sample Output
Test Set #1
1 to 20: 7
2 to 9: 5
19 to 5: 6
18 to 19: 2
16 to 20: 2

Test Set #2
1 to 20: 4
8 to 20: 5
15 to 16: 2
11 to 4: 1
7 to 13: 3
2 to 16: 4

Analysis and Summary:
Obvious Floyd algorithm, on Template

Code:
[Cpp]
# Include <cstdio>
# Include <iostream>
Using namespace std;
 
Const int N = 25;
Constint INF = 1000000000;
Int d [N] [N], n;
 
Inline void read_graph (){
For (int I = 1; I <N; ++ I ){
D [I] [I] = 0;
For (int j = I + 1; j <N; ++ j)
D [I] [j] = d [j] [I] = INF;
}
Int;
For (int I = 0; I <n; ++ I ){
Scanf ("% d", & );
D [1] [a] = d [a] [1] = 1;
}
For (int I = 2; I <= 19; ++ I ){
Scanf ("% d", & n );
For (int j = 0; j <n; ++ j ){
Scanf ("% d", & );
D [I] [a] = d [a] [I] = 1;
}
}
}
 
Void Floyd (){
For (int k = 1; k <= 20; ++ k ){
For (int I = 1; I <= 20; ++ I ){
For (int j = 1; j <= 20; ++ j)
If (d [I] [k]! = INF & d [k] [j]! = INF ){
D [I] [j] = min (d [I] [j], d [I] [k] + d [k] [j]);
}
}
}
}
Inline void output (){
Scanf ("% d", & n );
Int u, v;
For (int I = 0; I <n; ++ I ){
Scanf ("% d", & u, & v );
Printf ("% 2d to % 2d: % d \ n", u, v, d [u] [v]);
}
Printf ("\ n ");
}
Int main (){
Int cas = 1;
While (scanf ("% d", & n )! = EOF ){
Read_graph ();
Floyd ();
Printf ("Test Set # % d \ n", cas ++ );
Output ();
}
Return 0;
}