Question

The technicians faced a very interesting problem recently. given a set of btses to visit, they needed to find the shortest path to visit all of the given points and return back to the central company building. programmers have spent several months studying this problem but with no results. they were unable to find the solution fast enough. after a long time, one of the programmers found this problem in a conference article. unfortunately, he found that the problem is so called "traveling salesman problem" and it is very hard to solve. if we have n btses to be visited, we can visit them in any order, giving us n! possibilities to examine. the function expressing that number is called factorial and can be computed as a product 1.2.3.4....n. the number is very high even for a relatively small n.

Answer 1

I OK I get it..
but what do you want to know..