• <ins id="pjuwb"></ins>
    <blockquote id="pjuwb"><pre id="pjuwb"></pre></blockquote>
    <noscript id="pjuwb"></noscript>
          <sup id="pjuwb"><pre id="pjuwb"></pre></sup>
            <dd id="pjuwb"></dd>
            <abbr id="pjuwb"></abbr>
            隨筆 - 87  文章 - 279  trackbacks - 0
            <2025年7月>
            293012345
            6789101112
            13141516171819
            20212223242526
            272829303112
            3456789

            潛心看書研究!

            常用鏈接

            留言簿(19)

            隨筆分類(81)

            文章分類(89)

            相冊

            ACM OJ

            My friends

            搜索

            •  

            積分與排名

            • 積分 - 217919
            • 排名 - 117

            最新評論

            閱讀排行榜

            評論排行榜

            ?

            #include? < iostream >
            #include?
            < string >
            #include?
            < algorithm >
            using ? namespace ?std;


            int ?str_compare( string ?a,? string ?b)?
            {
            ????
            int ?rtn;
            ????
            int ?aLen? = ?a.length();
            ????
            int ?bLen? = ?b.length();
            ????
            if ?(aLen? > ?bLen)? {
            ????????rtn?
            = ? 1 ;
            ????}
            ? else ? if ?(aLen? < ?bLen)? {
            ????????rtn?
            = ? - 1 ;
            ????}
            ? else ? {
            ????????
            if ?(a? == ?b)? {
            ????????????rtn?
            = ? 0 ;
            ????????}
            ? else ? if ?(a? > ?b)? {
            ????????????rtn?
            = ? 1 ;
            ????????}
            ? else ? if ?(a? < ?b)? {
            ????????????rtn?
            = ? - 1 ;
            ????????}

            ????}

            ????
            return ?rtn;
            }


            string ?str_add( string ?a,? string ?b)
            {
            ????
            string ?c,?c1;
            ????
            int ?p,?q;
            ????
            int ?i;
            ????
            int ?tmp;
            ????
            bool ?flag;
            ????
            if ?(a.length()? < ?b.length())? {
            ????????swap(a,?b);
            ????}

            ????p?
            = ?a.length() - 1 ;
            ????q?
            = ?b.length() - 1 ;
            ????flag?
            = ? false ;
            ????
            while ?(q? >= ? 0 )? {
            ????????tmp?
            = ?a[p -- ]? + ?b[q -- ]? - 96 ;
            ????????
            if ?(flag)? {
            ????????????tmp
            ++ ;
            ????????}

            ????????flag?
            = ? false ;
            ????????
            if ?(tmp? >= ? 10 )? {
            ????????????tmp?
            -= ? 10 ;
            ????????????flag?
            = ? true ;
            ????????}

            ????????c?
            += ? char (tmp + 48 );
            ????}

            ????
            while ?(p? >= ? 0 )? {
            ????????tmp?
            = ?a[p -- ]? - ? 48 ;
            ????????
            if ?(flag)? {
            ????????????tmp
            ++ ;
            ????????}

            ????????flag?
            = ? false ;
            ????????
            if ?(tmp? >= ? 10 )? {
            ????????????tmp?
            -= ? 10 ;
            ????????????flag?
            = ? true ;
            ????????}

            ????????c?
            += ? char (tmp + 48 );
            ????}

            ????
            if ?(flag)? {
            ????????c?
            += ? ' 1 ' ;
            ????}

            ????
            for ?(i = c.length() - 1 ;?i >= 0 ;?i -- )? {
            ????????c1?
            += ?c[i];
            ????}

            ????
            return ?c1;
            }


            // a?>?b
            string ?str_minus( string ?a,? string ?b)?
            {
            ????
            if ?(str_compare(a,b)? == ? - 1 )? {
            ????????
            return ? " -1 " ;
            ????}

            ????
            string ?c,?c1;
            ????
            int ?i;
            ????
            int ?p? = ?a.length()? - ? 1 ;
            ????
            int ?q? = ?b.length()? - ? 1 ;
            ????
            while ?(q? >= ? 0 )? {
            ????????
            if ?(a[p]? < ?b[q])? {
            ????????????a[p
            - 1 ] -- ;
            ????????????c?
            += ? char (a[p]? - ?b[q]? + ? 58 );
            ????????}
            ? else ? {
            ????????????c?
            += ? char (a[p]? - ?b[q]? + ? 48 );
            ????????}

            ????????p
            -- ;
            ????????q
            -- ;
            ????}

            ????
            while ?(p? >= ? 0 )? {
            ????????
            if ?(a[p]? < ? ' 0 ' )? {
            ????????????a[p
            - 1 ] -- ;
            ????????????c?
            += ? char (a[p]? + ? 10 );
            ????????}
            ? else ? {
            ????????????c?
            += ?a[p];
            ????????}

            ????????p
            -- ;
            ????}

            ????i?
            = ?c.length() - 1 ;
            ????
            while ?(c[i]? == ? ' 0 ' )? {?
            ????????i
            -- ;
            ????}

            ????
            for ?(?;?i >= 0 ;?i -- )? {
            ????????c1?
            += ?c[i];
            ????}

            ????
            if ?(c1.length()? == ? 0 )? {
            ????????c1?
            += ? ' 0 ' ;
            ????}

            ????
            return ?c1;
            }


            string ?str_multiply( string ?a,? string ?b)?
            {
            ????
            if ?(str_compare(a,?b)? == ? - 1 )? {
            ????????swap(a,?b);
            ????}
            ????
            ????
            string ?c,?c1;
            ????
            string ?bb? = ?b,?aa? = ?a;
            ????
            int ?i,?j,?k,?bit;
            ????
            int ?p;
            ????
            int ?tmp;
            ????p?
            = ?bb.length() - 1 ;
            ????
            for ?(i = 0 ;?i < b.length();?i ++ )? {
            ????????b[i]?
            = ?bb[p -- ];
            ????}

            ????p?
            = ?aa.length() - 1 ;
            ????
            for ?(i = 0 ;?i < a.length();?i ++ )? {
            ????????a[i]?
            = ?aa[p -- ];
            ????}

            ????
            for ?(i = 0 ;?i < b.length();?i ++ )? {
            ????????bit?
            = ? 0 ;
            ????????
            for ?(j = 0 ;?j < a.length();?j ++ )? {
            ????????????
            if ?(i + j? >= ?c.length())? {
            ????????????????tmp?
            = ?(b[i]? - ? 48 )? * ?(a[j]? - ? 48 )? + ?bit;
            ????????????}
            ? else ? {
            ????????????????tmp?
            = ?(b[i]? - ? 48 )? * ?(a[j]? - ? 48 )? + ?bit? + ?(c[i + j]? - ? 48 );
            ????????????}

            ????????????bit?
            = ?tmp? / ? 10 ;
            ????????????tmp?
            = ?tmp? % ? 10 ;
            ????????????
            if ?(i + j? >= ?c.length())? {
            ????????????????c?
            += ? char (tmp + 48 );
            ????????????}
            ? else ? {
            ????????????????c[i
            + j]? = ? char (tmp + 48 );
            ????????????}

            ????????}

            ????????
            if ?(bit? > ? 0 )? {
            ????????????k?
            = ?i? + ?j;
            ????????????
            if ?(k? >= ?c.length())? {
            ????????????????c?
            += ? char (bit + 48 );
            ????????????}
            ? else ? {????????????
            ????????????????
            while ?(bit? != ? 0 )? {
            ????????????????????tmp?
            = ?bit? + ?(c[k]? - ? 48 );
            ????????????????????bit?
            = ?tmp? / ? 10 ;
            ????????????????????tmp?
            = ?tmp? % ? 10 ;
            ????????????????????
            if ?(k? >= ?c.length())? {
            ????????????????????????c?
            += ? char (tmp + 48 );
            ????????????????????}
            ? else ? {
            ????????????????????????c[k
            ++ ]? = ? char (tmp + 48 );
            ????????????????????}

            ????????????????}

            ????????????}

            ????????}

            ????}

            ????
            for ?(i = c.length() - 1 ;?i >= 0 ;?i -- )? {
            ????????c1?
            += ?c[i];
            ????}

            ????
            return ?c1;
            }

            // a?<?b?精確到100位
            string ?str_divide( string ?a,? string ?b)?
            {
            ????
            string ?c;
            ????
            string ?y,?tmp,?tmp3;
            ????
            int ?i;
            ????
            int ?flag;
            ????
            int ?last;
            ????
            if ?(str_compare(a,?b)? == ? 1 )? {
            ????????swap(a,?b);
            ????}

            ????a?
            += ? ' 0 ' ;
            ????
            for ?(i = 0 ;?i < 100 ;?i ++ )? {
            ????????
            if ?(str_compare(a,?b)? == ? - 1 )? {
            ????????????a?
            += ? ' 0 ' ;
            ????????????c?
            += ? ' 0 ' ;
            ????????}
            ? else ? {
            ????????????c?
            += ? ' 1 ' ;
            ????????????last?
            = ?c.length()? - ? 1 ;
            ????????????tmp?
            = ?b;
            ????????????tmp3?
            = ?str_minus(a,?tmp);
            ????????????
            while ?(str_compare(tmp3,?b)? != ? - 1 )? {
            ????????????????tmp?
            = ?str_add(tmp,?b);
            ????????????????c[last]
            ++ ;
            ????????????????tmp3?
            = ?str_minus(a,?tmp);
            ????????????}

            ????????????
            if ?(str_compare(tmp3,? " 0 " )? == ? 0 )? {
            ????????????????
            break ;
            ????????????}

            ????????????a?
            = ?tmp3;
            ????????????a?
            += ? ' 0 ' ;
            ????????}

            ????}

            ????
            return ?c;
            }
            posted on 2006-05-07 16:13 閱讀(937) 評論(0)  編輯 收藏 引用 所屬分類: 數據結構與算法
            国产一久久香蕉国产线看观看| 久久久九九有精品国产| 久久国产高清字幕中文| 伊人久久大香线蕉av不变影院| 久久久精品人妻无码专区不卡 | 亚洲精品久久久www| 婷婷综合久久中文字幕| 久久久精品免费国产四虎| 久久综合综合久久97色| 一本色道久久88加勒比—综合| 久久性精品| 国产日韩久久久精品影院首页| 久久亚洲高清综合| 人妻无码精品久久亚瑟影视| 久久人人爽人人爽人人片AV麻烦 | 狠狠色婷婷久久综合频道日韩| 国产精品日韩欧美久久综合| AAA级久久久精品无码片| 97久久精品无码一区二区天美| 欧美一区二区精品久久| 久久国产视频99电影| 四虎国产精品成人免费久久| 国产精品久久新婚兰兰 | 久久亚洲精品国产精品| 7国产欧美日韩综合天堂中文久久久久| 久久久久久久综合日本亚洲| 欧美精品丝袜久久久中文字幕| 97精品依人久久久大香线蕉97 | 久久婷婷久久一区二区三区| 久久久久久一区国产精品| 久久亚洲精品成人无码网站| 国内精品九九久久久精品| 久久精品这里只有精99品| 伊人久久久AV老熟妇色| 国产成人久久精品二区三区| 熟妇人妻久久中文字幕| 久久久久久久综合综合狠狠| 亚洲欧美成人综合久久久 | 成人免费网站久久久| 久久精品中文字幕第23页| 久久综合狠狠综合久久综合88|