摘要:
1 //求解模方程 a^x = b(mod n) n为素数,无解返回-1 2 int log_mod(int a, int b, int n) { 3 int m, v, e = 1, i; 4 m = (int) sqrt(n+0.5); 5 v = inv(pow_mod(a, m, n), n); 6 map x; 7 x[1] = ... 阅读全文
posted @ 2016-09-07 12:29
kiraa
阅读(488)
评论(0)
推荐(0)