Submission #3792312

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;

int main(){
  long long h,w,i,j,ans,mod=1000000007;
  cin >> h >> w;
  vector<long long> a(h*w);
  for(i=1; i<=h; i++){
    a[(i-1)]=1;
  }
  for(j=1; j<=w; j++){
    a[(j-1)*h]=1;
  }
  for(i=2; i<=h; i++){
    for(j=2; j<=w; j++){
      a[(i-1)+(j-1)*h]=a[(i-2)+(j-1)*h]+a[(i-1)+(j-2)*h];
      a[(i-1)+(j-1)*h]%=mod;
    }
  }
  cout << a[w*h-1] << endl;
}

Submission Info

Judge Result