We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
在大象出版社 2023 年第 2 次印刷的版本下,0x33 节(同余)对第 2 道例题的讲解(P168)中,提到在 0x03 节解决过这个问题。而事实上,至少在这个版本中,是在 0x02 节解决的这个问题,并且 0x03 节并没有再次解决这个问题。
同版本,0x5C 节(计数类 DP)对第 1 道例题的讲解(P366)中,提到 0x37 节为组合计数。事实上,至少在这个版本中,0x36 才是组合计数,0x37 是容斥原理。
The text was updated successfully, but these errors were encountered:
此 issue 已更新。
由于再次发现同类型的笔误,故合并 issues。
Sorry, something went wrong.
No branches or pull requests
在大象出版社 2023 年第 2 次印刷的版本下,0x33 节(同余)对第 2 道例题的讲解(P168)中,提到在 0x03 节解决过这个问题。而事实上,至少在这个版本中,是在 0x02 节解决的这个问题,并且 0x03 节并没有再次解决这个问题。
同版本,0x5C 节(计数类 DP)对第 1 道例题的讲解(P366)中,提到 0x37 节为组合计数。事实上,至少在这个版本中,0x36 才是组合计数,0x37 是容斥原理。
The text was updated successfully, but these errors were encountered: