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 conquestswith the goal oftransferring a large mass of armies from some starting country to adestination country. Typically,one chooses the intervening countries so as to minimize the total number ofcountries that need tobe conquered. Given a description of the gameboard with 20 countries eachwith between 1 and 19connections to other countries, your task is to write a function that takesa starting country and adestination country and computes the minimum number of countries that mustbe conquered toreach the destination. You do not need to output the sequence of countries,just the number ofcountries to be conquered including the destination. For example, ifstarting and destinationcountries are neighbors, then your program should return one.

The following connection diagram illustrates the first sample input.

Input 

Input to your program will consist of a series of country configurationtest sets. Each test set willconsist of a board description on lines 1 through 19. The representationavoids listing every nationalboundary twice by only listing the fact that country I borders country J when I < J. Thus, the Ithline, where I is less than 20, contains an integer X indicating how many``higher-numbered"countries share borders with country I, then X distinct integers J greaterthan I and not exceeding20, each describing a boundary between countries I and J. Line 20 of thetest set contains a singleinteger ()indicating the number of country pairs that follow.The next N lines eachcontain 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 shouldcontinue reading andprocessing until reaching the end of file. There will be at least onepath between any two given countries in every country configuration.

Output 

For each input set, your program should print the following message``Test Set #T" where T is thenumber of the test set starting with 1 (left-justified starting in column 11).

The next N_T lines eachwill contain the result for the corresponding test in the test set - that is,the minimum number ofcountries to conquer. The test result line should contain the start countrycode A right-justified incolumns 1 and 2; the string `` to " in columns 3 to 6; the destination country code B right-justified incolumns 7 and 8; the string ``: " in columns 9 and 10; and a single integer indicating the minimumnumber of moves required to traverse from country A to country B in thetest set left-justifiedstarting in column 11. Following all result lines of each input set, yourprogram should print a single blank line.

Sample Input 

1 32 3 43 4 5 61 61 72 12 131 82 9 101 111 112 12 171 142 14 152 15 161 161 192 18 191 201 2051 202 919 518 1916 204 2 3 5 61 43 4 10 55 10 11 12 19 182 6 72 7 82 9 101 91 102 11 143 12 13 143 18 17 134 14 15 16 170002 18 201 191 2061 208 2015 1611 47 132 16

Sample Output 

Test Set #1 1 to 20: 7 2 to  9: 519 to  5: 618 to 19: 216 to 20: 2Test Set #2 1 to 20: 4 8 to 20: 515 to 16: 211 to  4: 1 7 to 13: 3 2 to 16: 4

#include <iostream>#include <stack>#include <cstring>#include <cstdio>#include <string>#include <algorithm>#include <queue>#include <set>#include <map>#include <fstream>#include <stack>#include <list>#include <sstream>#include <cmath>using namespace std;#define ms(arr, val) memset(arr, val, sizeof(arr))#define mc(dest, src) memcpy(dest, src, sizeof(src))#define N 25#define INF 0x3fffffff#define vint vector<int>#define setint set<int>#define mint map<int, int>#define lint list<int>#define sch stack<char>#define qch queue<char>#define sint stack<int>#define qint queue<int>/*弗洛伊德算法*/int g[N][N];void floyd(){    for (int k = 1; k <= 20; k++)    {        for (int i = 1; i <= 20; i++)        {            for (int j = 1; j <= 20; j++)            {                if (g[i][j] > g[i][k] + g[k][j])                {                    g[i][j] = g[i][k] + g[k][j];                }            }        }    }}int main(){    int n, cs = 1, t;    while (~scanf("%d", &n))    {        for (int i = 1; i <= 20; i++)        {            for (int j = 1; j <= 20; j++)            {                g[i][j] = INF;            }        }        for (int i = 0; i < n; i++)        {            scanf("%d", &t);            g[1][t] = g[t][1] = 1;        }        for (int i = 2; i <= 19; i++)        {            scanf("%d", &n);            for (int j = 0; j < n; j++)            {                scanf("%d", &t);                g[i][t] = g[t][i] = 1;            }        }        floyd();        printf("Test Set #%d\n", cs++);        scanf("%d", &n);        int s, e;        while (n--)        {            scanf("%d%d", &s, &e);            printf("%2d to %2d: %d\n", s, e, g[s][e]);        }        putchar(‘\n‘);    }    return 0;}