Replies: 14 comments
-
|
普通bsgs时间复杂度不是O(根号p)么，怎么是O(根号q)，q是什么 |
Beta Was this translation helpful? Give feedback.
-
|
进阶篇-找到所有解那部分，之前的a变成k，b变成a，p变成n，即之前 x^a mod p=b 变成之后的 x^k mod n=a ，建议说明一下（真的琢磨k是什么琢磨了好久qwq |
Beta Was this translation helpful? Give feedback.
-
|
倒数第二个题好像把“模板”写成“目标”了 |
Beta Was this translation helpful? Give feedback.
-
|
是giant step，不是gaint step吧 |
Beta Was this translation helpful? Give feedback.
-
|
Hi @YOYO-UIAT ，方便开个 Pull Request 帮忙订正一下吗 |
Beta Was this translation helpful? Give feedback.
-
OK |
Beta Was this translation helpful? Give feedback.
-
|
是因为BZOJ没了，所以这个 BZOJ1319 链接到别的地方去了吗？ |
Beta Was this translation helpful? Give feedback.
-
|
基础篇 - 算法描述那里 |
Beta Was this translation helpful? Give feedback.
-
|
基础篇那里，复杂度到底是 O 还是 \Theta |
Beta Was this translation helpful? Give feedback.
-
|
能不能加一下Pohlig-Hellman 算法以及讲一下loj6542离散对数是怎么做的哇 |
Beta Was this translation helpful? Give feedback.
-
|
进阶篇的代码为啥过不了这个？ 261. Discrete Roots https://codeforces.com/problemsets/acmsguru/problem/99999/261 |
Beta Was this translation helpful? Give feedback.
-
|
能不能解释一下为什么那个基础篇0到P范围内一定有解 |
Beta Was this translation helpful? Give feedback.
-
https://oi-wiki.org/math/bsgs/
Beta Was this translation helpful? Give feedback.
All reactions