ZOJ Problem Set - 1037 Gridland
来源:互联网 发布:房地产数据来源 编辑:程序博客网 时间:2024/06/01 09:31
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
Source: Northwestern Europe 2001
分析:
找规律的水题。
ac代码:
#include <iostream>
#include<cstdio>
using namespace std;
int main()
{
int t;
int m,n;
int i=0;
scanf("%d",&t);
while(t--)
{
i++;
scanf("%d%d",&m,&n);
printf("Scenario #%d:\n%d.",i,m*n);
if(m%2==0||n%2==0)
printf("00\n");
else printf("41\n");
printf("\n");
}
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
- Properties
- 【汇编语言/底层开发】11、标识寄存器
- 选出有行连接(row chain)或者是行迁移(row migeration)的表
- 检索方法
- 应用框架的设计与实现.net平台--应用框架解析(框架分层)
- ZOJ Problem Set - 1037 Gridland
- 我的2014--大局观、匆忙、蓄势
- 2.13 子数组的最大乘积
- Tomcat 双向证书配置
- 游戏中如何实现GameCenter的应用
- 电脑文件整理思路
- 堆和栈的区别
- HTML5 零一
- OC 自带方法 简绍 5 NSDictionary