1037_Gridland
来源:互联网 发布:百度网盘搜索php源码 编辑:程序博客网 时间:2024/06/05 07: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<iomanip>
#include<cmath>
using namespace std;
int main()
{
int count;
int x,y;
double dis;
cin>>count;
for(int i=0;i!=count;++i)
{
cin>>x>>y;
if(x%2==0||y%2==0)//两数至少一偶,则正好能走回去,每个村子附带一段路1,共有x*y
{
dis=x*y;
cout<<"Scenario #"<<i+1<<":"<<endl;
cout<<setprecision(2)<<setiosflags(ios::fixed)<<dis<<endl;//控制小数点后有两个0
cout<<endl;
}
else//同奇,最后一段位“根2”
{
dis=x*y+sqrt(2.0)-1;
cout<<"Scenario #"<<i+1<<":"<<endl;
cout<<setprecision(2)<<setiosflags(ios::fixed)<<dis<<endl;
cout<<endl;
}
}
return 0;
}
- 1037_Gridland
- 1037
- 1037
- 1037
- ZOJ 1037
- zoj 1037
- zoj 1037
- zoj 1037
- zoj 1037
- HDU 1037
- hdu 1037
- hdu 1037
- zoj-1037
- Sicily 1037
- pat 1037
- hdu 1037
- zoj 1037
- ZOJ-1037
- android viewanimator viewfilter viewswitcher textswitcher imageswitcher
- 1048_Financial Management
- 使索引临时失效
- Pentium III处理器的单指令多数据流扩展指令入门
- 配置篇-安装openlaszlo平台及IDE
- 1037_Gridland
- u盘安装 oracle-linux redhat-linux
- poj 2356 &&poj 3370(开挂) 抽屉原理(鸽巢原理)同nyoj 636世界末日
- Bluehost注册流程与问题
- GPL和LGPL简介
- 矩阵转置的SSE汇编优化艺术以及ARM cortext 汇编优化
- 推荐系统相关算法(1):SVD
- win7 WIN2008 64位 安装使用 PLSQL Developer
- python中对文件、文件夹的操作