Submission #658682

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>
#include <cstdio>
#include <cmath>
#include <stack>
using namespace std;
typedef unsigned char byte;
typedef long long int LLint;
typedef unsigned long long int uLLint;


LLint d[1001][1001];
int main(){
    int x,y;
    LLint w,h,f;
    
    cin>>w>>h;
    
    if (w<h) swap(w,h);
    
    for (x=2;x<=w;x++){
        d[x][2]=x;
        d[2][x]=x;
    }
    for (y=3;y<=h;y++)
        for (x=3;x<=w;x++){
            d[x][y]=(d[x-1][y]+d[x][y-1])%1000000007LL;
        }
    
    cout<<d[w][h]<<endl;
    
    return 0;
}

Submission Info

Judge Result