精確計算100的階乘(C++)

來源:互聯網
上載者:User

#include <iostream><br />#include <vector></p><p>using namespace std;</p><p>void calc(vector<int>& v);<br />void print_result(const vector<int>& v);</p><p>int main() {<br />vector<int> v;<br />calc(v);<br />print_result(v);<br />return 0;<br />}</p><p>void calc(vector<int>& v) {<br />v.push_back(1);<br />for(int i = 1; i <= 100; ++i) {<br />const int len = static_cast<int>(v.size());<br />for(int j = 0; j < len; ++j) {<br />v[j] *= i;<br />}</p><p>for(int j = 0; j < len - 1; ++j) {<br />if(v[j] >= 10) {<br />v[j + 1] += v[j] / 10;<br />v[j] %= 10;<br />}<br />}</p><p>if(v[len - 1] >= 10) {<br />int carry = v[len - 1] / 10;<br />v[len - 1] %= 10;<br />do {<br />v.push_back(carry % 10);<br />carry /= 10;<br />} while (carry > 0);<br />}<br />}<br />}</p><p>void print_result(const vector<int>& v) {<br />const int len = static_cast<int>(v.size());<br />for(int i = len - 1; i >= 0; --i) {<br />cout << v[i];<br />}<br />cout << endl;<br />}

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.