HDU 1046 & POJ 1450 Gridland【有趣的数学题】

最新推荐文章于 2018-12-30 11:22:22 发布

AC_Dreameng

最新推荐文章于 2018-12-30 11:22:22 发布

阅读量1.7k

点赞数 1

分类专栏： POJ ACM_基础题(水题) HDU ACM_数学 ACM_HDU刷题录文章标签： HDU1046 POJ 1450 Gridland 有趣的数学题

本文链接：https://blog.csdn.net/hurmishine/article/details/51992672

版权

Gridland是一个涉及数学和编程的有趣问题，探讨了在特定网格环境中的路径寻找和计数策略。AC代码提供了有效的解决方案。

摘要由CSDN通过智能技术生成

Gridland

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 5697 Accepted Submission(s): 2607

Problem Description

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.

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 n