shunfurh 于 2017.09.04 14:24 提问
 Swordfish

There exists a world within our world
A world beneath what we call cyberspace.
A world protected by firewalls,
passwords and the most advanced
security systems.
In this world we hide
our deepest secrets,
our most incriminating information,
and of course, a shole lot of money.
This is the world of Swordfish.We all remember that in the movie Swordfish, Gabriel broke into the World Bank Investors Group in West Los Angeles, to rob $9.5 billion. And he needed Stanley, the best hacker in the world, to help him break into the password protecting the bank system. Stanley's lovely daughter Holly was seized by Gabriel, so he had to work for him. But at the last moment, Stanley made some little trick in his hacker mission: he injected a trojan horse in the bank system, so the money would jump from one account to another account every 60 seconds, and would continue jumping in the next 10 years. Only Stanley knew when and where to get the money. If Gabriel killed Stanley, he would never get a single dollar. Stanley wanted Gabriel to release all these hostages and he would help him to find the money back.
You who has watched the movie know that Gabriel at last got the money by threatening to hang Ginger to death. Why not Gabriel go get the money himself? Because these money keep jumping, and these accounts are scattered in different cities. In order to gather up these money Gabriel would need to build money transfering tunnels to connect all these cities. Surely it will be really expensive to construct such a transfering tunnel, so Gabriel wants to find out the minimal total length of the tunnel required to connect all these cites. Now he asks you to write a computer program to find out the minimal length. Since Gabriel will get caught at the end of it anyway, so you can go ahead and write the program without feeling guilty about helping a criminal.Input:
The input contains several test cases. Each test case begins with a line contains only one integer N (0 <= N <=100), which indicates the number of cities you have to connect. The next N lines each contains two real numbers X and Y(10000 <= X,Y <= 10000), which are the citie's Cartesian coordinates (to make the problem simple, we can assume that we live in a flat world). The input is terminated by a case with N=0 and you must not print any output for this case.Output:
You need to help Gabriel calculate the minimal length of tunnel needed to connect all these cites. You can saftly assume that such a tunnel can be built directly from one city to another. For each of the input cases, the output shall consist of two lines: the first line contains "Case #n:", where n is the case number (starting from 1); and the next line contains "The minimal distance is: d", where d is the minimal distance, rounded to 2 decimal places. Output a blank line between two test cases.Sample Input:
5
0 0
0 1
1 1
1 0
0.5 0.5
0Sample Output:
Case #1:
The minimal distance is: 2.83
 其他相关推荐
 数独之Swordfish
 候选数为8的情况。 观察AB行、CD行、EFG行，这三行把第一、八、九列占满了。 所以其他行的8不在第一、八、九列，所以可以排除掉r4c1，r6c8，r8c9这三个位置的候选数8. 再例如 对于AB列、CD列、EF列，这三列占据了1,3,7行，所以其他列的1不可能会有在这三行中出现，所以可以排除r1c8的1.
 Swordfish (最小生成树——克鲁斯卡尔方法)
 There exists a world within our world A world beneath what we call cyberspace. A world protected by firewalls, passwords and the most advanced security systems. In this world we hide our deepest secre
 Swordfish
 http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=1203 #include #include #include #include #include #include #include #include #include #include #include #include #incl
 ZOJ 1203 Swordfish （prim算法实现）
 Swordfish 用最小生成树prim实现的程序代码 已经AC了
 zoj_1203 Swordfish
 题目链接：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=203 //C++代码 #include #include #include #include using namespace std; struct Edge{ int u,v; double w; bool operator <(const Edge
 Swordfish （Kruskal）
 We all remember that in the movie Swordfish, Gabriel broke into the World Bank Investors Group in West Los Angeles, to rob $9.5 billion. And he needed Stanley, the best hacker in the world, to help hi
 ZOJ 1203 Swordfish （经典MST ~ Kruscal）Boruvka算法
 链接：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=203 Description： We all remember that in the movie Swordfish, Gabriel broke into the World Bank Investors Group in West Los Angeles, to
 1203 Swordfish
 /*1203SwordfishTime Limit: 1 Second Memory Limit: 32768 KBThere exists a world within our worldA world beneath what we call cyberspace.A world protected by firewalls,passwords and t
 ZOJ1203 Swordfish
 Swordfish Time Limit: 2 Seconds Memory Limit: 65536 KB There exists a world within our world A world beneath what we call cyberspace. A world protected by firewalls, passwords and the
 ZOJ1203 Swordfish
 /*prim算法，网上资料很多，在此不赘述*/ #include #include #include #include int n; bool visit[111]; double low[111]; double distance[111][111]; void prim(int num) { int i, cnt = 0; for(i = 0; i < n; i++) { i