MathDB

In MTRP district there are

10

cities. Bob the builder wants to make roads between cities in such a way so that one can go from one city to the other through exactly one unique path. The government has allotted him a budget of Rs.

20

and each road requires a positive integer amount (in Rs.) to build. In how many ways he can build such a network of roads? It is known that in the MTRP district, any positive integer amount of rupees can be used to construct a road, and that the full budget is used by Bob in the construction. Write the last two digits of your answer.

Problem Statement