Submission #326641

---

Source Code Expand

from math import factorial as f
def popcount(n):
  return bin(n).count('1')
while 1:
  try:
    r,c=map(int,input().split())
    h,w=map(int,input().split())
    d,l=map(int,input().split())
  except: break
  res=0
  for b in range(16):
    if h-popcount(b&3)<0 or w-popcount(b&12)<0: continue
    n=(h-popcount(b&3))*(w-popcount(b&12))
    if n<d+l: continue
    p=(-1)**popcount(b)
    res+=p*f(n)//f(d)//f(l)//f(n-d-l)
  res*=(r-h+1)*(c-w+1)
  print(res%int(1e9+7))

Submission Info

Judge Result