大数运算(支持负号 乘法用分治法目前缺除法)（The operation of large numbers (support minus multiplication with the method currently lack of division)）.docVIP

大数运算(支持负号 乘法用分治法目前缺除法)（The operation of large numbers (support minus multiplication with the method currently lack of division)） / / 旧弄; / / a = a1a0 = a1 * (10 ^ (n / 2)) + a0; / / b = b1b0 = b1 * (10 ^ (n / 2)) + b0; / / c = a * b = a1b1 * (10 ^ 2n) + [(a1b0 + b1a0) * (10 ^ n)] + a1b1 / / c = a * b = c * (10 ^ 2n) + c1 * (10 ^ n) + c0; / / c2 = a1 * b1; / / c0 = a0 * b0; / / c1 = (a1 + a0) * (b1 + b0) - (c2 +, 0); / / c1ノ猭ボ (临⊿暗拜肈び / / c1 = (a1 + a0) (b1 + b0) - c2 c0 璶σ納眔び斌 癘眔э! # include iostream # include fstream # define size 128 using namespace std; / / 璸衡计 int size _ of (char a []) { int i = 0; while (a [i]! = \ 0) + +; return; } class bignumber { private: / / 常そ秨ゑ耕糶 癘眔э糶 (? / / public: all sign; int array [size + size]; / / 逆计氮秈皚 int length; / / 计 bignumber (); / / 穝计 0 void print (); / / 陪ボ计 void carry (); / / 秈干 bignumber operator = (int); / / 钡结 bignumber operator + (bignumber ); / / 更笲衡 bignumber operator - (bignumber ); / / 更笲衡 bignumber operator * (bignumber ); / / 更笲衡 int vbs (bignumber ); / / vs big or small ゑ计ぃタ璽腹) }; / / 0 bignumber:: bignumber () { int i = 0; while (i size + size) array [+ +] = 0; length = 1; sign = true; / / タ } / / ゑ虫计ぃタ璽腹) a b = 1, a b = 0, a = b = 2 int bignumber: vbs (bignumber b) { if (length = = b.length) { int i = length 1; while (array [i] = = b.array [in] i = 0) - -; if ( 0) return 2; / / 单 else return (array [in] b.array [in])? 1: 0; } else return (length b.length)? 1: 0; } / / 猭璸衡Ч常璶秈 void bignumber:: carry () { int i = 0; while (array [in] | | in length - 1) { if (array [in] 9) { array [i + 1] + = array [in] / 10; array [i]% = 10; } else if (array [in] 0) { array [i] + = 10; array [i + 1] = 1; } in + +; } in = size + (size 1); / / 璸衡ヘ玡计 while (array [] = = 0 i 0) - -; length = i + 1; } void bignumber:: print () { for (int j = length 1; j = 0; i --) { if (((j + 1)% 32 = = 0 | | j = = length - 1) length 30) cout final; if (! sign j = = length - 1) cout -; cout array [j]; } cout