Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.python > #87037
| Date | 2015-03-06 11:30 -0500 |
|---|---|
| From | Dave Angel <davea@davea.name> |
| Subject | Re: Speeding up permutations generation |
| References | <CADgpKWb=q2=YEJSS1yRkgzF37nO5BNRnywm+zhcwF-MAOr6MdA@mail.gmail.com> <201503060532.03842.gheskett@wdtv.com> <54F98DFA.4090503@davea.name> <201503061114.06957.gheskett@wdtv.com> |
| Newsgroups | comp.lang.python |
| Message-ID | <mailman.118.1425659413.21433.python-list@python.org> (permalink) |
On 03/06/2015 11:14 AM, Gene Heskett wrote: > > > On Friday 06 March 2015 06:22:34 Dave Angel wrote: >> >> Sorry, but 50! is not even close to 50**50. The latter is 85 digits >> as you say, but 50! is "only" 64. >> >> >> 30414093201713378043612608166064768844377641568960512000000000000L > > What utility output that as an L ? > Python 2.7 interpreter, after calculating factorial with the obvious loop. Basically, it's using repr() on the expression, so it flags the integer as a long, rather than an int. I debated not including it, but this way I was sure of getting the right number of zeroes. My copy/paste is notorious for missing a character or two at each end. -- DaveA
Back to comp.lang.python | Previous | Next | Find similar | Unroll thread
Re: Speeding up permutations generation Dave Angel <davea@davea.name> - 2015-03-06 11:30 -0500
csiph-web