A city has a grid pattern, with 10 streets running north/south and 20 streets running east/west. What is the mimimum numver of blocks you have to walk to get from the the northwest corner to the southeast corner. How many ways can you get there walking this minimum number of blocks?

I assume the minimum is 30. How would you solve this problem? Could you do 10 choose 1 and 20 choose 1 and end up with 300?