title: with C++ shortest path algorithm with two numbers. (c++)
body: <p>if I got two integer a, b, I have to get the number of cases 2-D shortest path.
  If a = 2, b = 3,</p>
  
  <pre><code>h- - - 
  | | | |
   - - - 
  | | | | 
   - - -g
  </code></pre>
  
  <p>the path is from h to g.</p>
  
  <p>Could you tell me how to get the number of cases with C++?</p>