blocks|key|4509609|text|newLISP被设计成很小(~260K)，默认情况下不会支持非常大的整数，以及在普通整数和大整数之间进行必要的自动转换。如果你经常需要像1000这样的整数！在你的工作中，你可能选择了错误的语言。但是，如果您出于其他原因想要使用newLISP，并且确实需要计算100!，那么请安装GMP库，并按如下方式编写代码：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|4509610|(load+"gmp.lsp")
(define+(factorial-gmp+num)
+(if+(=+num+0)
++"1"
++(GMP:*+(string+num)+(factorial-gmp+(-+num+1)))))|code-block|syntax|javascript|4509611|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|I|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|J|8|@]|9|@]|A|$E|F]]|$1|G|3|-4|5|6|7|K|8|@]|9|@]|A|$]]]|H|$]]

newLISP is designed to be small (~260K), and one of the things you won't get by default is support for really big integers, and the necessary automatic conversion between ordinary-sized and big integers. If you regularly need integers such as 1000! in your work, then you've probably chosen the wrong language. However, if you want to use newLISP for other reasons, and really really need to calculate 100!, then install the GMP library, and write your code as follows:

<pre><code>(load "gmp.lsp")
(define (factorial-gmp num)
 (if (= num 0)
 "1"
 (GMP:* (string num) (factorial-gmp (- num 1)))))
</code></pre>

blocks|key|2493826|text|newLISP中最大的64位整数是9,223,372,036,854,775,807。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|2493827|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|D|8|@]|9|@]|A|$]]|$1|B|3|-4|5|6|7|E|8|@]|9|@]|A|$]]]|C|$]]

Largest 64-bit integer in newLISP is 9,223,372,036,854,775,807.

blocks|key|2872455|text|尝试浮点：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|2872456|(define+(fac+n)+(if+(=+n+1)+1+(mul+n+(fac+(sub+n+1)))))

(fac+20)+=>+2.432902008e%2B18|code-block|syntax|javascript|2872457|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|I|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|J|8|@]|9|@]|A|$E|F]]|$1|G|3|-4|5|6|7|K|8|@]|9|@]|A|$]]]|H|$]]

try floating point:

<pre><code>(define (fac n) (if (= n 1) 1 (mul n (fac (sub n 1)))))

(fac 20) =&gt; 2.432902008e+18
</code></pre>

blocks|key|4600024|text|从10.4.8版本开始，newLISP内置了对无限精度整数的支持(bigint)。这使得GNU+GMP模块gmp.lsp过时了。但由于bigint的工作方式，您将看到与典型的递归函数完全不同的阶乘函数：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|4600025|(define+(fac+n)+(apply+*+(map+bigint+(sequence+1+n))+2))
(fac+1000)

>+
(lambda+(n)+(apply+*+(map+bigint+(sequence+1+n))+2))
402387260077093773543702433923003985719374864210714632543799910429938512398629020592044208486969404800479988610197196058631666872994808558901323829669944590997424504087073759918823627727188732519779505950995276120874975462497043601418278094646496291056393887437886487337119181045825783647849977012476632889835955735432513185323958463075557409114262417474349347553428646576611667797396668820291207379143853719588249808126867838374559731746136085379534524221586593201928090878297308431392844403281231558611036976801357304216168747609675871348312025478589320767169132448426236131412508780208000261683151027341827977704784635868170164365024153691398281264810213092761244896359928705114964975419909342221566832572080821333186116811553615836546984046708975602900950537616475847728421889679646244945160765353408198901385442487984959953319101723355556602139450399736280750137837615307127761926849034352625200015888535147331611702103968175921510907788019393178114194545257223865541461062892187960223838971476088506276862967146674697562911234082439208160153780889893964518263243671616762179168909779911903754031274622289988005195444414282012187361745992642956581746628302955570299024324153181617210465832036786906117260158783520751516284225540265170483304226143974286933061690897968482590125458327168226458066526769958652682272807075781391858178889652208164348344825993266043367660176999612831860788386150279465955131156552036093988180612138558600301435694527224206344631797460594682573103790084024432438465657245014402821885252470935190620929023136493273497565513958720559654228749774011413346962715422845862377387538230483865688976461927383814900140767310446640259899490222221765904339901886018566526485061799702356193897017860040811889729918311021171229845901641921068884387121855646124960798722908519296819372388642614839657382291123125024186649353143970137428531926649875337218940694281434118520158014123344828015051399694290153483077644569099073152433278288269864602789864321139083506217095002597389863554277196742822248757586765752344220207573630569498825087968928162753848863396909959826280956121450994871701244516461260379029309120889086942028510640182154399457156805941872748998094254742173582401063677404595741785160829230135358081840096996372524230560855903700624271243416909004153690105933983835777939410970027753472000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000L|code-block|syntax|javascript|4600026|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|I|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|J|8|@]|9|@]|A|$E|F]]|$1|G|3|-4|5|6|7|K|8|@]|9|@]|A|$]]]|H|$]]

Since version 10.4.8 newLISP has built-in support (bigint) for unlimited precision integers. This makes the GNU GMP module gmp.lsp obsolete. But due to the way bigint works, you'll see a totally different factorial function than the typical recursive one:

<pre><code>(define (fac n) (apply * (map bigint (sequence 1 n)) 2))
(fac 1000)

> 
(lambda (n) (apply * (map bigint (sequence 1 n)) 2))
402387260077093773543702433923003985719374864210714632543799910429938512398629020592044208486969404800479988610197196058631666872994808558901323829669944590997424504087073759918823627727188732519779505950995276120874975462497043601418278094646496291056393887437886487337119181045825783647849977012476632889835955735432513185323958463075557409114262417474349347553428646576611667797396668820291207379143853719588249808126867838374559731746136085379534524221586593201928090878297308431392844403281231558611036976801357304216168747609675871348312025478589320767169132448426236131412508780208000261683151027341827977704784635868170164365024153691398281264810213092761244896359928705114964975419909342221566832572080821333186116811553615836546984046708975602900950537616475847728421889679646244945160765353408198901385442487984959953319101723355556602139450399736280750137837615307127761926849034352625200015888535147331611702103968175921510907788019393178114194545257223865541461062892187960223838971476088506276862967146674697562911234082439208160153780889893964518263243671616762179168909779911903754031274622289988005195444414282012187361745992642956581746628302955570299024324153181617210465832036786906117260158783520751516284225540265170483304226143974286933061690897968482590125458327168226458066526769958652682272807075781391858178889652208164348344825993266043367660176999612831860788386150279465955131156552036093988180612138558600301435694527224206344631797460594682573103790084024432438465657245014402821885252470935190620929023136493273497565513958720559654228749774011413346962715422845862377387538230483865688976461927383814900140767310446640259899490222221765904339901886018566526485061799702356193897017860040811889729918311021171229845901641921068884387121855646124960798722908519296819372388642614839657382291123125024186649353143970137428531926649875337218940694281434118520158014123344828015051399694290153483077644569099073152433278288269864602789864321139083506217095002597389863554277196742822248757586765752344220207573630569498825087968928162753848863396909959826280956121450994871701244516461260379029309120889086942028510640182154399457156805941872748998094254742173582401063677404595741785160829230135358081840096996372524230560855903700624271243416909004153690105933983835777939410970027753472000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000L</code></pre>

blocks|key|4509679|text|从10.4.8版本开始，newLISP内置了对无限精度整数的支持(bigint)。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|4509680|bigint递归阶乘：|4509681|>+(define+(fac+n)+(if+(=+n+1)+1+(*+(bigint+n)+(fac+(-+n+1)))))
>+(fac+20)
2432902008176640000L
>+(fac+30)
265252859812191058636308480000000L
>+(fac+40)
815915283247897734345611269596115894272000000000L|code-block|syntax|javascript|4509682|entityMap^0|0|0|0^^$0|@$1|2|3|4|5|6|7|K|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|L|8|@]|9|@]|A|$]]|$1|D|3|E|5|F|7|M|8|@]|9|@]|A|$G|H]]|$1|I|3|-4|5|6|7|N|8|@]|9|@]|A|$]]]|J|$]]

Since version 10.4.8 newLISP has built-in support (bigint) for unlimited precision integers. 

bigint recursive factorial:

<pre><code>&gt; (define (fac n) (if (= n 1) 1 (* (bigint n) (fac (- n 1)))))
&gt; (fac 20)
2432902008176640000L
&gt; (fac 30)
265252859812191058636308480000000L
&gt; (fac 40)
815915283247897734345611269596115894272000000000L
</code></pre>

I run facorial function using ECL and newlisp.

ECL:

<pre><code>&gt;(defun fac (n) (if (= n 1) 1 (* n (fac (- n 1)))))
&gt;(fac 20)
22432902008176640000
&gt;(fac 30)
2265252859812191058636308480000000
&gt;(fac 40)
815915283247897734345611269596115894272000000000
...
</code></pre>

newlisp

<pre><code>&gt;(define (fac n) (if (= n 1) 1 (* n (fac (- n 1)))))
&gt;(fac 20)
22432902008176640000
&gt;(fac 30)
-8764578968847253504
</code></pre>

Why does newlisp return different result with ecl ?

About factorial in newlisp

翻译质量差，导致语言生硬或混乱。

没有提供实际的解决方法或示例。

解答不清晰，无法理解或解决问题。

页面排版不美观，阅读体验差。

文章

问答

视频

教程

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

腾讯iOA零信任安全管理系统专区

腾讯云架构师技术同盟交流圈

腾讯云数据库专区

腾讯云智能顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云AI代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

功能1上新10个字符

功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符。

功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符。

功能5描述100个字符功能5描述100个字符功能5描述100个字符功能5描述100个字符功能5描述100个字符功能5描述100个字符

功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符

功能4上新

文章&问答评论现已支持表情

全新交互，全新视觉，新增快捷键、悬浮工具栏、高亮块等功能并同时优化现有功能，全面提升创作效率和体验

社区富文本编辑器全新改版！诚邀体验～ 

精选全网热门MCP server，让你的AI更好用 🚀

💥开发者 MCP广场重磅上线！

涵盖代码开发、场景应用、自动测试全流程，助你从零构建专属AI助手

一站式MCP教程库，解锁AI应用新玩法

聚焦“写作效率、视觉美观与运行性能”三方面进行全面升级，为您提供更高效、稳定的创作环境

社区富文本&Markdown编辑器全新改版上线，欢迎大家体验!

诚挚邀请您参与本次调研，分享您的真实使用感受与建议。您的反馈至关重要，感谢您的支持与参与！

社区新版编辑器体验调研

我使用ECL和newlisp运行因子函数。ECL：>(defun fac (n) (if (= n 1) 1 (* n (fac (- n 1)))))>(fac 20)22432902008176640000>(fac 30)2265252859812191058636308480000000>(fac 40)8159152832478977343456112695961158942720000

问关于newlisp中的阶乘
EN

回答 5

Stack Overflow用户

Stack Overflow用户

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问关于newlisp中的阶乘EN

回答 5

Stack Overflow用户

Stack Overflow用户

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问关于newlisp中的阶乘
EN