All Roads Lead to Rome!
你站在非负数对网格中的点(x, y) 上，希望到达原点(0, 0) 。在任何一点，你都可以向左或向下移动一步。此外，您永远不允许进入tabu 列表中的任何点（原点永远不在tabu 中）。在这些限制条件下，该函数应将从(x,y) 点到原点(0,0) 的不同路径数相加。
如果你觉得自己需要提示，这里有两种解题思路（点击提示）：
提示 1
这个经典组合问题的受限变体有一个相当简单的递归解法。作为基本情况，从原点(0, 0) 到自身的路径数等于空路径的 1（注意存在的空路径与不存在的路径之间的关键区别！）。如果点(x, y) 在tabu 列表中，则从该点到原点的路径数等于零。否则，从该点到原点的路径数等于两个相邻点 (x-1, y) 和 (x, y-1) 的路径之和。然而，这种简单的递归分支会产生指数级的可能性，因此执行起来可能会过于缓慢。因此，您应该使用lru_cache 对递归进行记忆，或者更好的方法是...
提示 2
完全不要使用递归，而是建立一个二维列表，其中的条目是各个子问题的解决方案。用两个 for 循环按照一定的顺序填入正确的值，以保证当这些循环到达...
CheckiO Extensions allow you to use local files to solve missions. More info in a blog post.
In order to install CheckiO client you'll need installed Python (version at least 3.8)
Install CheckiO Client first:
pip3 install checkio_client
Configure your tool
checkio --domain=py config --key=
Sync solutions into your local folder
checkio sync
(in beta testing) Launch local server so your browser can use it and sync solution between local file end extension on the fly. (doesn't work for safari)
checkio serv -d
Alternatevly, you can install Chrome extension or FF addon
checkio install-plugin
checkio install-plugin --ff
checkio install-plugin --chromium
Read more here about other functionality that the checkio client provides. Feel free to submit an issue in case of any difficulties.
Welcome to Pair Programming! Engage in real-time collaboration on coding projects by starting a session and sharing the provided unique URL with friends or colleagues. This feature is perfect for joint project development, debugging, or learning new skills together. Simply click 'Start Session' to begin your collaborative coding journey!
You are trying to join a pair programming session that has not started yet.
Please wait for the session creator to join.
It looks like the creator of the pair programming session closed the editor window.
It might happen accidentally, so that you can wait for reconnection.
