ZOJ1037解答
来源:互联网 发布:淘宝社区在哪里找 编辑:程序博客网 时间:2024/04/30 05:29
ZOJ1037题目为Gridland,背景知识是旅行商问题,刚开始以这个思路考虑的,结果很麻烦,没法求解。其实考察的就是基本的编程,找到图的规律就Ok了。
Background
For years, computer scientists have been trying to find efficient solutions to different computing problems. For some of them efficient algorithms are already available, these are the "easy" problems like sorting, evaluating a polynomial or finding the shortest path in a graph. For the "hard" ones only exponential-time algorithms are known. The traveling-salesman problem belongs to this latter group. Given a set of N towns and roads between these towns, the problem is to compute the shortest path allowing a salesman to visit each of the towns once and only once and return to the starting point.
Problem
The president of Gridland has hired you to design a program that calculates the length of the shortest traveling-salesman tour for the towns in the country. In Gridland, there is one town at each of the points of a rectangular grid. Roads run from every town in the directions North, Northwest, West, Southwest, South, Southeast, East, and Northeast, provided that there is a neighbouring town in that direction. The distance between neighbouring towns in directions North-South or East-West is 1 unit. The length of the roads is measured by the Euclidean distance. For example, Figure 7 shows 2 * 3-Gridland, i.e., a rectangular grid of dimensions 2 by 3. In 2 * 3-Gridland, the shortest tour has length 6.
Figure 7: A traveling-salesman tour in 2 * 3-Gridland.
Input
The first line contains the number of scenarios.
For each scenario, the grid dimensions m and n will be given as two integer numbers in a single line, separated by a single blank, satisfying 1 < m < 50 and 1 < n < 50.
Output
The output for each scenario begins with a line containing "Scenario #i:", where i is the number of the scenario starting at 1. In the next line, print the length of the shortest traveling-salesman tour rounded to two decimal digits. The output for every scenario ends with a blank line.
Sample Input
2
2 2
2 3
Sample Output
Scenario #1:
4.00
Scenario #2:
6.00
C代码如下:
- #include<stdio.h>
- void shotroad(int x,int y,int num)
- {
- printf("Scenario #%d:/n",num);
- if(x*y%2 == 0)
- printf("%.2f/n/n",x*y+0.00);
- else
- printf("%.2f/n/n",x*y+0.41);
- }
- int main()
- {
- int i, j=1;
- if(scanf("%d",&i)==EOF || i<=0)
- return 0;
- for(;j<=i;j++)
- {
- int m,n;
- if(scanf("%d %d",&m,&n)==EOF || m<=1 || m>=50 || n<=1 || n>=50)
- return 0;
- shotroad(m,n,j);
- }
- return 0;
- }
- ZOJ1037解答
- ZOJ1037
- zoj1037
- zoj1037
- Zoj1037
- ZOJ1037
- ZOJ1037
- zoj1037-Gridland
- Python--ZOJ1037
- ZOJ1037-Gridland
- ZOJ1037-Gridland
- 【简单】ZOJ1037 Gridland
- Gridland ZOJ1037(规律)
- IntegerSet解答
- DSP解答
- GADGETS解答
- VIM解答
- WAP 解答
- java学习资料网址
- 小程序12
- 推己及人
- 创建文件之文件描述符
- createQuery与createSQLQuery区别(转)
- ZOJ1037解答
- 个人日记
- 中软国际
- MySQL命令集锦(1)
- 使用E-R图设计数据库(任务四)
- MySQL命令集锦(2)
- csdn,不错!
- 小程序14
- 第一次,祝福,期待!