A city has M roads from north-south and N roads from east-west. The roads are small enough that the entire road is visible from any point on the road. The governor wants to monitor the roads, so he wishes to place policemen at intersections. What is the minimum number of policemen needed so that the entire road network is visible?
- via Math Puzzles