擷取階乘n!的最後一個非零數字

來源:互聯網
上載者:User
#include <iostream>using namespace std;unsigned LastNotZeroDigit[1000];long long Factorial[100];unsigned CleanLastZeros(unsigned num);//清除數字後面的0unsigned GetLastNotZeroDigit(unsigned num);//擷取數位最後一位非零數字unsigned GetLastNotZeroDigitOfFactorial(unsigned n);//擷取n!的最後一位非零數字long long GetFactorial(unsigned n);//計算n!int main(int argc, char* argv[]){for(unsigned i=0; i<20; i++){cout<<i<<"   "<<GetFactorial(i)<<"   "<<GetLastNotZeroDigitOfFactorial(i)<<endl;}getchar();return 0;}unsigned CleanLastZeros(unsigned num){int tmpNum = num;for(int i=0; i<num; i++){if(tmpNum%10 == 0){tmpNum /= 10;}else{break;}}return tmpNum;}unsigned GetLastNotZeroDigit(unsigned num){num = CleanLastZeros(num);num %= 10;return num;}unsigned GetLastNotZeroDigitOfFactorial(unsigned n){if(n == 0){LastNotZeroDigit[0] = 1;}else if(n == 1){LastNotZeroDigit[1] = 1;}else{LastNotZeroDigit[n] = GetLastNotZeroDigit(n * GetLastNotZeroDigitOfFactorial(n - 1) );}return LastNotZeroDigit[n];}long long GetFactorial(unsigned n){if(n == 0){Factorial[0] = 1;}else if(n == 1){Factorial[1] = 1;}else{Factorial[n] = n * GetFactorial(n - 1);}return Factorial[n];}

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在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.