今天写了
char p[maxn], t[maxn];void get(void) { next[0] = next[1] = 0; int i, j; for(i = 1; i <= m; i++) { j = next[i]; while(j && p[i] != p[j]) j=next[j]; ne
LL a[maxn], b[maxn], n;void extend_gcd(LL a, LL b, LL &d, LL &x, LL &y){ if(b == 0) { d = a, x = -= x*(a/b); }}void extend_chinese_reminde
Copyright © 2005-2024 51CTO.COM 版权所有 京ICP证060544号
