ZOJ Problem Set - 1037||Gridland
来源:互联网 发布:数据库开发规范 编辑:程序博客网 时间:2024/05/19 14:52
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
水过,不多说。
#include <iostream>#include <stdio.h>#include <math.h>using namespace std;int main(){int t,i,a,b;float c;cin >> t;for (i = 1; i <= t; i++){cin >> a >> b;cout << "Scenario #" << i << ":" << endl;if (a % 2 && b % 2)c = a*b - 1+sqrt(2);elsec = a*b;printf("%.2f\n", c);cout << endl;}return 0;}
- ZOJ Problem Set - 1037 Gridland
- ZOJ Problem Set - 1037 Gridland
- ZOJ Problem Set - 1037 Gridland
- ZOJ Problem Set - 1037||Gridland
- ZOJ Problem Set - 1037
- ZOJ Problem Set - 1037
- ZOJ-1037-Gridland
- zoj 1037 Gridland
- zoj 1037 Gridland
- zoj 1037 gridland
- ZOJ 1037 Gridland
- ZOJ 1037 Gridland
- zoj 1037 Gridland
- ZOJ 1037 Gridland
- ZOJ 1037 Gridland
- ZOJ 1037 Gridland
- ZOJ - 1037 Gridland
- zoj 1037 Gridland
- Win8.1 + MinGW4.4 + Qt Creator 3.3.2 + Qt-4.8.5
- 移动sever端开发工程师 base北京海淀区
- UVA 10420 解题报告
- 第3章 第4题
- 算法导论(第三版) 第三章练习题
- ZOJ Problem Set - 1037||Gridland
- 《深入云计算:Hadoop应用开发实战详解》(万川梅,谢正兰).[PDF]无密码下载
- 第三章 第5题
- matlab 生成 稀疏 对称正定 矩阵
- CodeForces Prizes, Prizes, more Prizes
- snow night 门谷纯
- hdu 1710 Binary Tree Traversals
- MySQL中使用子查询IN效率较低的问题
- Java复习笔记6【求四位吸血鬼数字】