fork(1) download
  1. # your code goes here
  2. import sys
  3. a={}
  4. def ways(p,q):
  5. if a.has_key((p,q)):
  6. return a[p,q]
  7. if p==0 or q==0:
  8. return 0
  9. elif p==1:
  10. return q*(q-1)
  11. elif q==1:
  12. return p*(p-1)
  13. else:
  14. a[(p-1,q)]=ways(p-1,q)
  15. if not a.has_key((p,q-1)):
  16. a[(p,q-1)]=ways(p,q-1)
  17. if not a.has_key((p-1,q-1)):
  18. a[(p-1,q-1)]=ways(p-1,q-1)
  19. return 4*min(p-1,q-1)+2*(p-1+q-1)+ways(p-1,q)+ways(p,q-1)-ways(p-1,q-1)
  20. print ways(100,223)
Success #stdin #stdout 0.14s 7852KB
stdin
Standard input is empty
stdout
10907100