三星研究院上机测试邮件范例2-optimal Path

ticktick3

于 2018-10-24 21:06:56 发布

阅读量3.7k

点赞数

分类专栏： C语言文章标签： C语言最短路径

本文链接：https://blog.youkuaiyun.com/u011537121/article/details/83350371

版权

这是一道编程题目，要求使用C语言找出商人从办公室出发，访问所有客户并返回家中最短的路径。路径计算方式为两点间横纵坐标的绝对值之和。题目强调不需要考虑效率，可以通过全排列求解。输入包含多个测试用例，每个用例给出客户数量及坐标。输出是最短路径的距离。解题关键在于全排列的实现和全局变量的正确使用。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

考试时间三个小时，我在实验室耗费整整三个多小时，只做了一道题！！！说多了全是泪。。。

全英文题，看题时间就。。。。哎、算了。英文题如下：

Mr. Kim has to deliver refrigerators to N customers. From the office, he is going to visit all the customers and then return to his home. Each location of the office, his home, and the customers is given in the form of integer coordinates (x,y) (0≤x≤100, 0≤y≤100) . The distance between two arbitrary locations (x1, y1) and (x2, y2) is computed by |x1-x2| + |y1-y2|, where |x| denotes the absolute value of x; for instance, |3|=|-3|=3. The locations of the office, his home, and the customers are all distinct. You should plan an optimal way to visit all the N customers and return to his among all the possibilities.

You are given the locations of the office, Mr. Kim’s home, and the customers; the number of the customers is in the range of 5 to 10. Write a program that, starting at the office, finds a (the) shortest path visiting all the customers and returning to his home. Your program only have to report the distance of a (the) shortest path.

You don’t have to solve this probl