620081110基础代码总结.docVIP

-------------------------------------------------------------------------------- 高精运算: typedef struct //为方便处理,用结构体 { int len ; long num [1024] ; } HNum ; //万进制高精加法, 注意输出高位补0, printf (%04d …) ; void HPlus (HNum a, HNum b, HNum c) { int i, len = a.len b.len ? a.len : b.len ; memset (c, 0, sizeof (HNum)) ; for (i = 1 ; i = len ; i ++) { c.num [i] += a.num [i] + b.num [i] ; if (c.num [i] = BASE) { c.num [i+1] += c.num [i] / BASE ; c.num [i] %= BASE ; } } c.len = len ; while (c.num [c.len+1] 0) c.len ++ ; } //万进制高精乘法 void HMul (HNum a, HNum b, HNum c) { int i, j ; memset (c, 0, sizeof (HNum)) ; for (i = 1 ; i = a.len ; i ++) for (j = 1 ; j = b.len ; j ++) { c.num [i+j-1] += a.num [i] * b.num [j] ; //注意+号 if (c.num [i+j-1] = BASE) { c.num [i+j] += c.num [i+j-1] / BASE ; //注意+号 c.num [i+j-1] %= BASE ; } } c.len = a.len + b.len - 1 ; while (c.num [c.len+1] 0) // c.len ++ ; } //万进制高精减法 void HSub (HNum a, HNum b, HNum c) { int i, len = a.len ; //保证a = b memset (c, 0, sizeof (HNum)) ; for (i = 1 ; i = len ; i ++) { c.num [i] += a.num [i] - b.num [i] ; //注意+号 if (c.num [i] 0) { c.num [i+1] -= 1 ; //注意-号 c.num [i] += BASE ; } } c.len = len ; while (c.len 0 c.num [c.len] == 0) c.len -- ; } //万进制高精减法, 直接就 long long…. -------------------------------------------------------------------------------- //Fibonacci, Fibo [i] = Fibo [i-1] + Fibo [i-2], Fibo [3] = 3 ; // Catalan数列S[n] = C(2n,n)/(n+1) long Catalan (long n) { long i, x, y ; x = y = 1 ; for (i = 2 ; i = n ; i ++) x *= i ; for (i = n ; i = 2*n ; i ++) y *= i ; return y/x/(n + 1) ; } //最小公倍数 long lcm (long a, long b) { return a*b/gdc (a, b) ; } //最大公约数, 辗转相除法 long gdc (long a, long b) { return (a%b == 0)? b : gdc (b, a%b) ; } ------------------------------------------------------------------------------------------------------------ //堆操作