学步园

<br /> #include <iostream><br /> #include <Windows.h><br /> using namespace std;</p> <p>#define MAXSIZE 100</p> <p>////高精度<span class='wp_keywordlink'><a href="http://www.xuebuyuan.com/category/%E7%AE%97%E6%B3%95" title="算法" target="_blank">算法</a></span></p> <p>struct Data<br /> {<br /> int len; //数据长度<br /> int s[MAXSIZE]; // 保存数据数组</p> <p>};</p> <p>void StringToData(const string& s, Data& d) //将string 转换为Data<br /> {</p> <p> if (s.size() == 0)<br /> {<br /> return;<br /> }<br /> ZeroMemory(&d, sizeof(d));<br /> d.len = s.length();<br /> for (int i = 0; i < d.len; ++i)<br /> {<br /> d.s[i] = s[d.len - i - 1] - '0'; //比如说s ="123"，那么s依次为3、2、1<br /> }<br /> }</p> <p>void Display(const Data& d)<br /> {<br /> for (int i = d.len - 1; i >= 0; --i)<br /> {<br /> cout<<d.s[i];<br /> }<br /> }</p> <p>void Add(const Data& d1, const Data& d2, Data& ret) //高精度加法<br /> { </p> <p> int len;<br /> int distance_len = 0; //长度差<br /> bool flag = 0; //默认的是d1长<br /> if (d1.len > d2.len )<br /> {<br /> len = d2.len;<br /> distance_len = d1.len - d2.len;<br /> }<br /> else<br /> {<br /> len = d1.len;<br /> distance_len = d2.len - d1.len;<br /> flag = 1;<br /> } </p> <p> ZeroMemory(&ret, sizeof(ret));<br /> int temp = len;<br /> //先把多余的数据保存在ret<br /> for (int i = 1; i <= distance_len; ++i)<br /> {<br /> if (flag)<br /> {<br /> ret.s[temp] = d2.s[len + i - 1];<br /> }<br /> else<br /> {<br /> ret.s[temp] = d1.s[len + i - 1];<br /> } </p> <p> ++temp; </p> <p> } </p> <p> for (int i = 0; i < len; ++i)<br /> {<br /> ret.s[i] = d1.s[i] + d2.s[i]; </p> <p> }<br /> ////////进位处理，如果大于10的话进1<br /> for (int i = 0 ; i < len + distance_len; ++i)<br /> { </p> <p> if (ret.s[i] >= 10)<br /> {<br /> ret.s[i] -= 10;<br /> ret.s[i + 1] ++;<br /> }<br /> }<br /> ret.len = distance_len + len;<br /> if (ret.s[len + distance_len] > 0)<br /> {<br /> ++ret.len; </p> <p> } </p> <p>} </p> <p>void Subtract( Data& d1, Data& d2, Data& ret) //假定d1>=d2<br /> {</p> <p> ZeroMemory(&ret, sizeof(ret));<br /> ret.len = d1.len;<br /> for (int i = 0; i < d1.len; ++i)<br /> {<br /> ret.s[i] = d1.s[i] - d2.s[i] + 10;<br /> d1.s[i + 1] = d1.s[i + 1] - 1 +ret.s[i]/10;<br /> ret.s[i] %= 10;<br /> }<br /> int j = 0;<br /> while (ret.s[j]==0 && j < ret.len) j++;</p> <p> if (j == ret.len) //如果结果全部为0<br /> {<br /> ret.len = 1; //长度为1<br /> return;<br /> }</p> <p> while (ret.s[ret.len - 1] == 0) //把后面的0滤掉<br /> {<br /> ret.len--;<br /> }</p> <p>}</p> <p>int main()<br /> {<br /> string s1 = "130000000000000000000000";<br /> Data a;<br /> StringToData(s1, a);<br /> string s2 = "455555500000";<br /> Data b;<br /> StringToData(s2, b);<br /> Data c;<br /> Subtract(a, b, c);<br /> Display(c);<br /> cout<<endl;<br /> string s3= "130000000000000000000000";<br /> Data e;<br /> StringToData(s3, e);<br /> string s4 = "455555500000";<br /> Data f;<br /> StringToData(s4, f);<br /> Data g;<br /> Add(e, f, g);<br /> Display(g);<br /> return 0;<br /> }</p> <p>