日韩性视频-久久久蜜桃-www中文字幕-在线中文字幕av-亚洲欧美一区二区三区四区-撸久久-香蕉视频一区-久久无码精品丰满人妻-国产高潮av-激情福利社-日韩av网址大全-国产精品久久999-日本五十路在线-性欧美在线-久久99精品波多结衣一区-男女午夜免费视频-黑人极品ⅴideos精品欧美棵-人人妻人人澡人人爽精品欧美一区-日韩一区在线看-欧美a级在线免费观看

歡迎訪問 生活随笔!

生活随笔

當前位置: 首頁 > 编程资源 > 编程问答 >内容正文

编程问答

【模板】高精度

發布時間:2023/12/3 编程问答 41 豆豆
生活随笔 收集整理的這篇文章主要介紹了 【模板】高精度 小編覺得挺不錯的,現在分享給大家,幫大家做個參考.

ACM模板


#include<string> #include<cstdio> #include<cstring> #include<iostream> #include<algorithm> using namespace std; struct bign {int d[200010], len;bign() { memset(d, 0, sizeof d); len = 1; }bign(int num) { *this = num; }bign(char* num) { *this = num; }bign operator=(const char* num){len = strlen(num);for (int i = 0; i < len; i++) d[i] = num[len - i - 1] - '0';return *this;}bign operator=(int num){char c[1010];sprintf(c, "%d", num);*this = c;return *this;}void clear(){while (len > 1 && !d[len - 1]) len--;}bign operator+(const bign& b){bign c; c.len = 0;for (int i = 0, t = 0; t || i < len || i < b.len; i++){if (i < len) t += d[i];if (i < b.len) t += b.d[i];c.d[c.len++] = t % 10;t /= 10;}return c;}bign operator-(const bign& b){bign c; c.len = 0;for (int i = 0, t = 0; i < len; i++){t += d[i];if (i < b.len) t -= b.d[i];c.d[c.len++] = (t + 10) % 10;if (t >= 0) t = 0;else t = -1;}c.clear();return c;}bign operator*(const bign& b){bign c; c.len = len + b.len;for (int i = 0; i < len; i++) for (int j = 0; j < b.len; j++) c.d[i + j] += d[i] * b.d[j];for (int i = 0; i < c.len - 1; i++) c.d[i + 1] += c.d[i] / 10, c.d[i] %= 10;c.clear();return c;}bool operator < (const bign& b){if (len != b.len) return len < b.len;for (int i = len - 1; i >= 0; i--)if (d[i] != b.d[i]) return d[i] < b.d[i];return false;}bool operator <= (const bign& b){if (len != b.len) return len < b.len;for (int i = len - 1; i >= 0; i--)if (d[i] != b.d[i]) return d[i] < b.d[i];return true;}bool operator > (const bign& b){if (len != b.len) return len > b.len;for (int i = len - 1; i >= 0; i--)if (d[i] != b.d[i]) return d[i] > b.d[i];return false;}bool operator >= (const bign& b){if (len != b.len) return len > b.len;for (int i = len - 1; i >= 0; i--)if (d[i] != b.d[i]) return d[i] > b.d[i];return true;}bign operator+=(const bign& b){*this = *this + b;return *this;}bign operator-=(const bign& b){*this = *this - b;return *this;}bign operator*=(const bign& b){*this = *this * b;return *this;}void print(){for (int i = len - 1; i >= 0; i--) std::cout << d[i];cout << '\n';}string str(){string res = "";for (int i = 0; i < len; i++) res = (char)(d[i] + '0') + res;return res;} }; istream& operator >>(istream& in, bign& x) {string s;in >> s;x = s.c_str();return in; } ostream& operator <<(ostream& out, bign& x) {out << x.str();return out; } int main() {bign a,b,c;cin>>a>>b;c=a+b;cout<<c<<'\n'; }

總結

以上是生活随笔為你收集整理的【模板】高精度的全部內容,希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯,歡迎將生活随笔推薦給好友。