学步园

终于瞅见一道最短路的题了~~~哈哈~~

这个题目好长啊，好长啊。。。

挺不容易的 读完题。。。其实没仔细读，基本看了看样例输入输出还有那个图就知道啦~~呵呵

就是求两点中间的最少的城市个数，That's all.

#include <stdio.h><br /> #include <stdlib.h><br /> #include <iostream><br /> #include <string.h><br /> using namespace std;<br /> int main(void)<br /> {<br /> int map[25][25];<br /> int count = 1,from,to,n;<br /> while( scanf("%d",&n)!= EOF )<br /> {<br /> for(int i=1; i<=20; i++)<br /> for(int k=1; k<=20; k++)<br /> map[i][k] = 10000;<br /> while( n-- )<br /> {<br /> scanf("%d",&to);<br /> map[1][to] = map[to][1] = 1;<br /> }<br /> for(int i=2; i<=19; i++)<br /> {<br /> scanf("%d",&n);<br /> while( n-- )<br /> {<br /> scanf("%d",&to);<br /> map[i][to] = map[to][i] = 1;<br /> }<br /> }<br /> for(int i=1; i<=20; i++) //Floyd~~~~<br /> for(int k=1; k<=20; k++)<br /> for(int j=1; j<=20; j++)<br /> if( map[k][j] > map[k][i] + map[i][j] )<br /> map[k][j] = map[k][i] + map[i][j];<br /> scanf("%d",&n);<br /> printf("Test Set #%d/n",count++);<br /> while( n-- )<br /> {<br /> scanf("%d %d",&from,&to);<br /> printf("%d to %d: %d/n",from,to,map[from][to]);<br /> }<br /> printf("/n"); // Don't forget this, = =...PE..<br /> }<br /> return 0;<br /> }<br />