[UVA][DLX、最少重覆覆蓋] 10160 - Servicing Stations
Problem D: Servicing stations
A company offers personal computers for sale in N towns (3 <= N <= 35).
The towns are denoted by 1, 2, ..., N. There are direct routes connecting M
pairs from among these towns. The company decides to build servicing stations in
several ...
