2020-2021:teams:legal_string:bsgs
差别
这里会显示出您选择的修订版和当前版本之间的差别。
| 两侧同时换到之前的修订记录 前一修订版 | |||
|
2020-2021:teams:legal_string:bsgs [2020/07/26 20:21] qgjyf2001 |
2020-2021:teams:legal_string:bsgs [2020/07/26 20:21] (当前版本) qgjyf2001 |
||
|---|---|---|---|
| 行 76: | 行 76: | ||
| inline bool isin(int x) { int f = find(x); return mp[f] == x; } | inline bool isin(int x) { int f = find(x); return mp[f] == x; } | ||
| - | inline int IAKIOI(int x) { int f = find(x); return hsh[f]; } | + | inline int f(int x) { int f = find(x); return hsh[f]; } |
| inline void clear() { | inline void clear() { | ||
| 行 90: | 行 90: | ||
| b = s; | b = s; | ||
| for (int i = 1; i <= m; ++i, b = (1LL * b * s) % p) | for (int i = 1; i <= m; ++i, b = (1LL * b * s) % p) | ||
| - | if (ht.isin(b)) return printf("%d\n", i * m - ht.IAKIOI(b) + 1) & 0; | + | if (ht.isin(b)) return printf("%d\n", i * m - ht.f(b) + 1) & 0; |
| return puts("no solution") & 0; | return puts("no solution") & 0; | ||
| } | } | ||
| </code> | </code> | ||
2020-2021/teams/legal_string/bsgs.1595766061.txt.gz · 最后更改: 2020/07/26 20:21 由 qgjyf2001
