BETA

Find number of ways to visit n-1 cities one by one.

There are n cities and m roads(m>n), number of ways you can visit n-1 cities one by one (each time we start from the origin of the city and reach to destination through minimum path and you have to output the number of different combination possible for all the visit(for each city) with given constraint.

Login to Answer
Sort By:
Oldest
|
Newest
|
Vote
|
My Answer