ACM高精度运算ACM（ACM high precision operation ACM）.docVIP

ACM高精度运算ACM（ACM high precision operation ACM） acm高精度运算acm # includes stdio.h # includes string.h char c [2000]; / / 全局变量, 存储大数运算的结果 char arr [1000]; / / 高精度除以高精度的余数 the z = 0; / / 高精度除以低精度的余数 int judge (char ch []) {/ / 判断字符串ch是否全为, 若全为, 返回, 否则返回 int i, k; k = strlen (ch). for (i = 0; i k; i + +) if (ch [i]. = 0) return 0; return 1; } int compare (char a [], char b []) {/ / 比较字符串的大小, 方法不同于strcmp函数, 类似于整型常量的比较 int lena, lenb, the; lena = strlen (); lenb = strlen (b); if (lena lenb) return - 1; else if (lena) lenb) return 1; else { if (strcmp (a, b) = = 0) return 0; else {for (i = 0; i lena; i + +) {if (a [i] b [i]) return 1; if (a [i] and b [i]) return - 1;} return 0; }}} / * 算法: 先确定a和b中的最大位数k, 然后依照由低至高位的顺序进行加法运算. 注意进位, 若高位有进位, 则c的长度为k + 1 * / / / 高精度加法 void bignumberadd (char a1 [], char b []) { int i, j, k, lena, lenb; int a [1000] = {0}, b [a] = {0}, d [1000] = {0}. lena = strlen (a1). lenb = strlen (b1). for (i = 0; i lena; i + +) / / 将加数与被加数化为整型数组, 并且该数组的其他位为 [i] = a1 [lena] - 1 - 0. for (i = 0; i lenb; i + +) b [i] = b [lenb - 1 -] - 0. k = lena lenb? lena: lenb; / / 当数组除了加数和被加数以外的整型数组元素均为时, 无需考虑lena和lenb的大小 for (i = 0; i k; i + +) {d [i] = a [i] + b [i] + f [i]; d [i + 1] = d [i + 1] + f [i] / 10; d [i] = d []% 10;} while (d [k]) / / 若高位进 k + +; while (! d (k - 1)) k -; / / 001 + 3 = 4 for (j = 0, j k; j + +) / / 将整型数组逆着转变并赋值给c字符型数组 c [j] = d [k - j - 1) + 0. if (judge) (c)) / / 若全为, 则只输出一个 strcpy (c, 0). } / * 算法: 依照由低位至高位的顺序进行减法运算.在每次位运算中. 若出现不够减的情况, 则向高位借位.在进行了la的减法后, 若最高 位为, 则a的长度减.若a、b大小未知, 则需先判断大小. * / / / 高精度减法 void bignumbersub (char a1 [], char b []) {/ / a1为被减数, b1为减数 int lena, lenb, i, j, k, flags; int a [1000] = {0}, b [a] = {0}, d [1000] = {0}. lena = strlen (a1). lenb = strlen (b1). if (compare (a1, b1) = 0) {/ / 若被减数大于等于减数 for (i = 0; i lena; i + +) [i] = a1 [lena] - 1 - 0. for (i = 0; i lenb; i + +) b [i] = b [lenb - 1 -] - 0. flag = 0; / / 结果正的标志 } else {/ / 若被减数小于减数 for (i = 0; i lenb; i + +) [i] = b [lenb - 1 -] - 0. for (i