Submission #122933

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<string>
#include<vector>
using namespace std;
#define MOD 1000000007
int R, C, Y, X, D, L;
int dp[30][30][900];
int rec(int y,int x,int dn){
  if(y == Y) return !dn;
  if(dn > Y * X - y * x) return 0;
  //残りのデスク　残りのます
  if(dp[y][x][dn]) return dp[y][x][dn];
  int nx = (x + 1) % X;
  int ny = (x + 1 == X) ? y + 1 : y;
  //たせたらたす
  return dp[y][x][dn]  = (rec(ny,nx,dn-1) + rec(ny,nx,dn)) % MOD;
}
int main(){
  cin >> R >> C;
  cin >> Y >> X;
  cin >> D >> L;
  cout << (rec(0,0,D) * (R-Y+1) * (C-X+1) % MOD) << endl;
}

Submission Info

Judge Result