Unique Path

 class Solution {  
 public:  
   int uniquePaths(int m, int n) {  
     int dp[1000] = {-1};  
     dp[0] = 1;  
     for(int i = 0; i < m; ++i) {  
       for(int j = 1; j < n; ++j) {  
         dp[j] = dp[j] + dp[j - 1];  
       }  
     }   
     return dp[n - 1];  
   }  
 };