🐣 문제

링크 : https://school.programmers.co.kr/learn/courses/30/lessons/42898

🐥 코드

#include <string>
#include <vector>

using namespace std;

int solution(int m, int n, vector<vector<int>> puddles) {
    int answer = 0;
    
    int dp[101][101];
    
    dp[1][1] = 1;
    
    for(int i = 0; i < puddles.size(); i++){
        dp[puddles[i][1]][puddles[i][0]] = -1;
    }
    
    for(int i = 1; i <= n; i ++){
        for(int j = 1; j <= m ; j++){
            int a = 0, b= 0;

            if(dp[i][j] == -1) continue;
            if(dp[i-1][j] != -1) a = dp[i-1][j];
            if(dp[i][j-1] != -1) b = dp[i][j-1];
            
            dp[i][j] += (a+b) % 1000000007;
        }
    }
    
    return dp[n][m];
}