高精度阶乘运算
代码随便写的,见笑了。{:10_254:}因为程序语言中的数据类型大小有限,所以不能运算值太大的阶乘,所以这里自定义新数据类型 Number,用来运算精度阶乘。
示例:式计算出高精度 999 的阶乘
运算结果:
999! = 402387260077093773543702433923003985719374864210714632543799910429938512398629020592044208486969404800479988610197196058631666872994808558901323829669944590997424504087073759918823627727188732519779505950995276120874975462497043601418278094646496291056393887437886487337119181045825783647849977012476632889835955735432513185323958463075557409114262417474349347553428646576611667797396668820291207379143853719588249808126867838374559731746136085379534524221586593201928090878297308431392844403281231558611036976801357304216168747609675871348312025478589320767169132448426236131412508780208000261683151027341827977704784635868170164365024153691398281264810213092761244896359928705114964975419909342221566832572080821333186116811553615836546984046708975602900950537616475847728421889679646244945160765353408198901385442487984959953319101723355556602139450399736280750137837615307127761926849034352625200015888535147331611702103968175921510907788019393178114194545257223865541461062892187960223838971476088506276862967146674697562911234082439208160153780889893964518263243671616762179168909779911903754031274622289988005195444414282012187361745992642956581746628302955570299024324153181617210465832036786906117260158783520751516284225540265170483304226143974286933061690897968482590125458327168226458066526769958652682272807075781391858178889652208164348344825993266043367660176999612831860788386150279465955131156552036093988180612138558600301435694527224206344631797460594682573103790084024432438465657245014402821885252470935190620929023136493273497565513958720559654228749774011413346962715422845862377387538230483865688976461927383814900140767310446640259899490222221765904339901886018566526485061799702356193897017860040811889729918311021171229845901641921068884387121855646124960798722908519296819372388642614839657382291123125024186649353143970137428531926649875337218940694281434118520158014123344828015051399694290153483077644569099073152433278288269864602789864321139083506217095002597389863554277196742822248757586765752344220207573630569498825087968928162753848863396909959826280956121450994871701244516461260379029309120889086942028510640182154399457156805941872748998094254742173582401063677404595741785160829230135358081840096996372524230560855903700624271243416909004153690105933983835777939410970027753472000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000(2500++ 位)
C++ 代码:#include <iostream>
#include <vector>
// using namespace std;
using std::vector;
using std::ostream, std::operator<<;
class Number {
public:
vector <unsigned> self;
Number();
Number(int);
Number(vector <unsigned>);
Number operator*=(const Number&);
friend ostream& operator << (ostream& os, const Number&);
};
using std::string;
void reverse(vector <unsigned>&);
void swap(unsigned&, unsigned&);
vector <unsigned> int_to_vector(int);
vector <unsigned> int_to_vector(string);
Number::Number()
{
this->self = vector <unsigned>(1, 0);
}
Number::Number(int num)
{
this->self = int_to_vector(num);
}
Number::Number(vector<unsigned> num)
{
this->self = num;
}
Number Number::operator*=(const Number& number)
{
vector <unsigned>
A = this->self,
B = number.self,
C(A.size() + B.size(), 0);
unsigned a, b, c;
reverse(A), reverse(B);
for (int x = 0; x < B.size(); ++x) {
for (int y = 0; y < A.size(); ++y) {
a = A, b = B;
c = a * b;
C += c;
}
}
for (int i = 0; i < C.size(); ++i) {
c = C;
if (c > 9) {
C += c / 10;
C %= 10;
}
}
reverse(C);
this->self = C;
return *this;
}
using std::endl;
ostream& operator<<(ostream& os, const Number& number)
{
bool flag = false;
for (auto num : number.self) {
if (num) {
flag = true;
}
if (flag) {
os << num;
}
}
os << endl;
return os;
}
Number factorial(int n) {
Number number(1);
do {
number *= n;
n--;
} while (n);
return number;
}
using std::cout;
int main(void) {
int n = 999; // <------------------------------------------
cout << factorial(n);
return 0;
}
void reverse(vector <unsigned> & num) {
for (int i = 0; i < num.size() >> 1; ++i) {
swap(num, num);
}
}
void swap(unsigned& A, unsigned& B) {
unsigned temp = A;
A = B;
B = temp;
}
vector<unsigned> int_to_vector(int num)
{
vector <unsigned> res;
do {
res.push_back(num % 10);
num /= 10;
} while (num);
reverse(res);
return res;
}
vector<unsigned> int_to_vector(string num)
{
vector <unsigned> res;
for (char c : num) {
res.push_back(c - '0');
}
return res;
}402387260077093773543702433923003985719374864210714632543799910429938512398629020592044208486969404800479988610197196058631666872994808558901323829669944590997424504087073759918823627727188732519779505950995276120874975462497043601418278094646496291056393887437886487337119181045825783647849977012476632889835955735432513185323958463075557409114262417474349347553428646576611667797396668820291207379143853719588249808126867838374559731746136085379534524221586593201928090878297308431392844403281231558611036976801357304216168747609675871348312025478589320767169132448426236131412508780208000261683151027341827977704784635868170164365024153691398281264810213092761244896359928705114964975419909342221566832572080821333186116811553615836546984046708975602900950537616475847728421889679646244945160765353408198901385442487984959953319101723355556602139450399736280750137837615307127761926849034352625200015888535147331611702103968175921510907788019393178114194545257223865541461062892187960223838971476088506276862967146674697562911234082439208160153780889893964518263243671616762179168909779911903754031274622289988005195444414282012187361745992642956581746628302955570299024324153181617210465832036786906117260158783520751516284225540265170483304226143974286933061690897968482590125458327168226458066526769958652682272807075781391858178889652208164348344825993266043367660176999612831860788386150279465955131156552036093988180612138558600301435694527224206344631797460594682573103790084024432438465657245014402821885252470935190620929023136493273497565513958720559654228749774011413346962715422845862377387538230483865688976461927383814900140767310446640259899490222221765904339901886018566526485061799702356193897017860040811889729918311021171229845901641921068884387121855646124960798722908519296819372388642614839657382291123125024186649353143970137428531926649875337218940694281434118520158014123344828015051399694290153483077644569099073152433278288269864602789864321139083506217095002597389863554277196742822248757586765752344220207573630569498825087968928162753848863396909959826280956121450994871701244516461260379029309120889086942028510640182154399457156805941872748998094254742173582401063677404595741785160829230135358081840096996372524230560855903700624271243416909004153690105933983835777939410970027753472000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000 电脑会不会卡死 深谙流年 发表于 2022-10-1 19:05
电脑会不会卡死
三位数目前正常运行,四位数可能需要时间 {:10_254:} 傻眼貓咪 发表于 2022-10-1 19:44
三位数目前正常运行,四位数可能需要时间
强啊 >> s=1
>>> for x in range(1,1000):
... s*=x
...
>>> print(s)
402387260077093773543702433923003985719374864210714632543799910429938512398629020592044208486969404800479988610197196058631666872994808558901323829669944590997424504087073759918823627727188732519779505950995276120874975462497043601418278094646496291056393887437886487337119181045825783647849977012476632889835955735432513185323958463075557409114262417474349347553428646576611667797396668820291207379143853719588249808126867838374559731746136085379534524221586593201928090878297308431392844403281231558611036976801357304216168747609675871348312025478589320767169132448426236131412508780208000261683151027341827977704784635868170164365024153691398281264810213092761244896359928705114964975419909342221566832572080821333186116811553615836546984046708975602900950537616475847728421889679646244945160765353408198901385442487984959953319101723355556602139450399736280750137837615307127761926849034352625200015888535147331611702103968175921510907788019393178114194545257223865541461062892187960223838971476088506276862967146674697562911234082439208160153780889893964518263243671616762179168909779911903754031274622289988005195444414282012187361745992642956581746628302955570299024324153181617210465832036786906117260158783520751516284225540265170483304226143974286933061690897968482590125458327168226458066526769958652682272807206344631797460594682573103790084024432438465657245014402821885252470935190620929023136493273497565513958720559654228749774011413346962715422845862377387538230483865688976461927383814900140767310446640259899490222221765904339901886018566526485061799702356193897017860040811889729918311021171229845901641921068884387121855646124960798722908519296819372388642614839657382291123125024186649353143970137428531926649875337218940694281434118520158014123344828015051399694290153483077644569099073152433278288269864602789864321139083506217095002597389863554277196742822248757586765752344220207573630569498825087968928162753848863396909959826280956121450994871701244516461260379029309120889086942028510640182154399457156805941872748998094254742173582401063677404595741785160829230135358081840096996372524230560855903700624271243416909004153690105933983835777939410970027753472000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
>>>
wp231957 发表于 2022-10-2 10:33
>> s=1
>>> for x in range(1,1000):
... s*=x
还是 Python 简单,哈哈{:10_282:}{:10_282:}{:10_282:}
但我个人比较喜欢 C++多于 Python,因为比较有写代码的感觉。{:10_264:} 傻眼貓咪 发表于 2022-10-2 10:37
还是 Python 简单,哈哈
但我个人比较喜欢 C++多于 Python,因为比较 ...
结果长度为2565 不知道python内部是如何实现的
但是楼主的代码以及代码思路却是完全不懂了 c++ 过于深奥复杂不准备涉猎了
页:
[1]