Submission #1381480

---

Source Code Expand

#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <math.h>
#include <limits.h>
#include <map>
#include <algorithm>
#include <functional>
using namespace std;

long long dp[1000][1000];

int main() {
    
    int W,H;
    
    cin >> W;
    cin >> H;
    
    dp[0][0] = 1;
       
    for ( int i = 0; i < W; i++ ) {
    for ( int j = 0; j < H; j++ ) {
        if ( i-1 >= 0 ) { dp[i][j] += dp[i-1][j]; }
        if ( j-1 >= 0 ) { dp[i][j] += dp[i][j-1]; }
        dp[i][j] %= 1000000007;
    }
    }
    
    cout << dp[W-1][H-1] << endl;
    
    return 0;
}

Submission Info

Judge Result