Hey poseurs. We got one for you.

Write a C program to compute the subfactorial of an integer N.

Y'all have heard of a factorial. How 'bout a subfactorial?

Here is a sequence of subfactorials for N = {1 ... 23}:

https://oeis.org/A000166

Up to only 23???!!!

Sheesh! We can do better than than:

[~] ./subfact 100

34332795984163804765195977526776142032365783805375784983543400282685180793327632432791396429850988990237345920155783984828001486412574060553756854137069878601

Want more? Sure thing:

[~] ./subfact 1000

14803000037166908036391661411896605423778724677168346155469184608988881712223607118131898739105486754595907261891306739525659267393783595677224116822252829559568359672098066622060942783190488524202959939181458674649296321772234031777719557526036601005901065517214473828487886175820813100473503581847756936878643206163201618844680768591094032183257299664998148177225232519104008615442655465753845844453576571787103394661377170235030562526500432038824338609787926268308284687038595978195448895638997039257894428866045929503123450747873671688182413678362258453513880598228814528531570929204492468054921792979011598454501444152175573572630619545719977057269175466361778739141804356429129546354423234562381423409107524548165524061776819460080161337045457955036099046921494250558537193329579482073018245976548713930256766892643871330503507495009590818187572187062902844270418881793062808259576971164630971090271338957781392498508419548968760204661950200896096197933697120001184583297276649682042523230901442416038335254943258717580459951322429538762079323749213310619485478167533526424544336840634977862657715415393616579517641428024670820968425502109482342196679493125860192623788850206306117990892038912
24372800966941803187567295401877435229552876934033446271920081932431500479266831162067898087375203299321759266896310398013332052717730686941198866814394082086345366161621254849682464332990866189720387263201435245301591551228160672094793591589751046761756899429729095389819155186104380589668134545521358106176432683265088847400075630578125577568721198279481770124987200028465843200836028835056752239304157102409433831420876970912375704827813522561628095930489973076363690716903735444753347277222269644018381058041040336988590465080726362211212847672561792613846955758001267778719146087997403331351690780850403018707387007219860265183241445978545343939401105488747714567335488196900148911502998833745690361445040756502842471542911226022625777386345023944680666372606015155904126779976563721389884798926297873448554696259931889022153417439765913357861346124264844165570744850851379226488885571276189802041073412065174561117871776566686203971568747523655416897364591156339098482517035347569029493318500822966694103069801757199864821884463334464508239561580295442683950514237400428199863686124549042552063736848425988571362282393268539068601119113908474985451813508750353980668686219599738700364731082064
70890805125591766035651660263166256071859066523494404932873989243033885387310363168734739688132495065765084286985470381074859852651721482664917019227944750044815550686001

Now you try.

C only.

See y'all in 2632.

Ha, ha, ha, ha, ha, ha, ha, ha, ha, ha!

On Jun 15, 2024 at 10:29:04 AM EDT, "Farley Flud" <ff@linux.rocks> wrote:

> Hey poseurs. We got one for you.
>
> Write a C program to compute the subfactorial of an integer N.

Why don't you come up with something original? All of these trivial math
problems have already been solved. Millions of times. A simple search will
bring up the code. Which is undoubtedly how you did it.

AGAIN, there is SO much more to programming than "solving" math problems that
no longer need to be "solved". The fact that all you do is "solve math
problems" proves how clueless you are about programming.

"Look at me. My computer can do math!" Whoopee! SO impressive.

What's next from you? "Write a C Program to Display the Fibonacci Sequence"?

Farley Flud wrote this copyrighted missive and expects royalties:

> <junksnip>

I got bigger fish to fry.

--
As flies to wanton boys are we to the gods; they kill us for their sport.
-- Shakespeare, "King Lear"

On Sat, 15 Jun 2024 14:29:04 +0000, Farley Flud wrote:

>
> Write a C program to compute the subfactorial of an integer N.
>

Nobody got it (as predicted).

The code is posted below.

We use the GNU Multi-Precision library (GMP) to compute for N of
any size up to ULONG_MAX. The subfactorial of ULONG_MAX could not
be stored in even the top supercomputer memory.

GMP is the absolute best mp library on planet Earth and that's
why it's used by all top software. Without GMP, Microslop would
be dead in the fucking water.

Dynamic programming is utilized for the best speed/storage.

As an extra, the ratio subfactorial/factorial is also calculated
as this should quickly converge to 0.367879...

=========================
Begin GMP Code
=========================

// ./subfact N
// don't attempt ./subfact ULONG_MAX, you'll break your machine
// but if anyone has a terabyte or so of ram then report run time
// this code should beat anything else anywhere

#include <stdlib.h>
#include <stdio.h>
#include <gmp.h>

int main(int argc, char **argv)
{

unsigned long int n, i;
double ratio;
mpz_t subfact, p1, p2, curr, fact;
mpq_t dvd, div;

mpz_inits(subfact, p1, p2, curr, fact, NULL);
mpq_inits(dvd, div, NULL);

n = atol(argv[1]);
mpz_set_str(p2, "1", 10);

// we ignore N = 1, 2 as they are trivial

for (i = 3L; i <= n; ++i) {
mpz_add(curr, p1, p2);
mpz_mul_ui(curr, curr, (i - 1L));
mpz_set(p1, p2);
mpz_set(p2, curr);
}
mpz_set(subfact, p2);

mpz_out_str(stdout, 10, subfact);
putchar('\n');

// Extra:
// for probability calcs we determine the factorial
// and then the ratio subfact/fact

mpz_fac_ui(fact, n);
mpq_set_z(div, fact); mpq_set_z(dvd, subfact);
mpq_div(dvd, dvd, div);
ratio = mpq_get_d(dvd);
fprintf(stdout, "Ratio to fact: %g\n", ratio);

return 0;

}

===================
End
===================

Subfactorials for 3 - 50

2
9 44
265
1854
14833
133496
1334961
14684570
176214841
2290792932
32071101049
481066515734
7697064251745
130850092279664
2355301661033953
44750731559645106
895014631192902121
18795307255050944540
413496759611120779881
9510425471055777937262
228250211305338670494289
5706255282633466762357224
148362637348470135821287825
4005791208408693667174771274
112162153835443422680893595673
3252702461227859257745914274516
97581073836835777732377428235481
3025013288941909109703700275299910
96800425246141091510518408809597121
3194414033122656019847107490716704992
108610077126170304674801654684367969729
3801352699415960663618057913952878940514
136848697178974583890250084902303641858505
5063401795622059603939253141385234748764684
192409268233638264949691619372638920453057993
7503961461111892333037973155532917897669261726
300158458444475693321518926221316715906770469041
12306496796223503426182275975073985352177589230680
22225533213979647187685190410983617546032726150608122
22225533213979647187685190410983617546032726150608122
977923461415104476258148378083279172025439950626757369
44006555763679701431616677013747562741144797778204081604
2024301565129266265854367142632387886092660697797387753785
95142173561075514495155255703722230646355052796477224427894
4566824330931624695767452273778667071025042534230906772538913
223774392215649610092605161415154686480227084177314431854406736
11188719610782480504630258070757734324011354208865721592720336801

Chris Ahlstrom <OFeem1987@teleworm.us> wrote:
>Farley Flud wrote this copyrighted missive and expects royalties:
>
>> <junksnip>
>
>I got bigger fish to fry.

Yeah, how does some obscure "challenge" like that advocate an
operating system? Just retarded.

--
Joel W. Crump

Amendment XIV
Section 1.

[...] No state shall make or enforce any law which shall
abridge the privileges or immunities of citizens of the
United States; nor shall any state deprive any person of
life, liberty, or property, without due process of law;
nor deny to any person within its jurisdiction the equal
protection of the laws.

Dobbs rewrites this, it is invalid precedent. States are
liable for denying needed abortions, e.g. TX.

On Sat, 15 Jun 2024 17:13:10 +0000, Tyrone wrote:

>
> AGAIN, there is SO much more to programming than "solving" math
>

Totally incorrect.

ALL programming is reducible to mathematics.

YOU just cannot understand this basic fact because your pathetic indoctrination
to programming has occurred through multi-layers of obscuring abstractions.

You should thank the gods for such abstractions, otherwise you'd be begging
on the streets.

Ha, ha, ha, ha, ha, ha, ha, ha, ha, ha, ha, ha!

Question: Why is Rust so popular?

Answer: Because it saves all the incompetent idiots who cannot adequately
wield C.

On Sat, 15 Jun 2024 19:20:19 +0000, Farley Flud wrote:

> On Sat, 15 Jun 2024 14:29:04 +0000, Farley Flud wrote:
>
>>
>> Write a C program to compute the subfactorial of an integer N.
>>
>
> Nobody got it (as predicted).
>
> The code is posted below.
>

Oops. I fergot.

At this point all the poseurs are frantically searching the Interwebs
in a desperate attempt to find code identical or similar to the posted
code.

Well those fucking idiot assholes can search and search until they
are blue in the face but they'll find nothing.

Google should be smart enough (but it isn't) to report "you are a fucking
ignoramus asshole" as the result of their attempts (but it won't).

It's no matter. We already know the truth.

Ha, ha, ha, ha, ha, ha, ha, ha, ha, ha, ha, ha, ha!

GNU/Linux: The only choice for potent creators.

Microslop Winblows: The only haven for poseurs and cheaters.

Le 15-06-2024, Farley Flud <ff@linux.rocks> a écrit :
>
> We already know the truth.

Yes, you just confirm it. Once again. You are not alone in your head and
you are in an asylum, not in your mother's basement.

--
Si vous avez du temps à perdre :
https://scarpet42.gitlab.io

On Jun 15, 2024 at 3:20:19 PM EDT, "Farley Flud" <ff@linux.rocks> wrote:

> On Sat, 15 Jun 2024 14:29:04 +0000, Farley Flud wrote:
>
>>
>> Write a C program to compute the subfactorial of an integer N.
>>
>
> Nobody got it (as predicted).

Because no one bothered.

This is all trivial stuff. These math "problems" have already been solved
multiple times. That you think this is a "programming challenge" just shows
how utterly clueless you are.

Hint: people were doing this 60 years ago on mainframes using Fortran. That
you have only now discovered this proves AGAIN how utterly clueless you are.

What's next? Compute Pi to a million decimal places? That also has already
been done many times. Sounds like another great "programming challenge" for
your feeble brain.

Diego Garcia <dg@chaos.rocks> wrote at 19:57 this Saturday (GMT):
> On Sat, 15 Jun 2024 17:13:10 +0000, Tyrone wrote:
>
>>
>> AGAIN, there is SO much more to programming than "solving" math
>>
>
> Totally incorrect.
>
> ALL programming is reducible to mathematics.

Right!

> YOU just cannot understand this basic fact because your pathetic indoctrination
> to programming has occurred through multi-layers of obscuring abstractions.
>
> You should thank the gods for such abstractions, otherwise you'd be begging
> on the streets.
>
> Ha, ha, ha, ha, ha, ha, ha, ha, ha, ha, ha, ha!
>
> Question: Why is Rust so popular?
>
> Answer: Because it saves all the incompetent idiots who cannot adequately
> wield C.

Well, Rust does have some nice features. I subjectively dislike the
syntax, but it is a nice language (despite the controversies)
--
user <candycane> is generated from /dev/urandom

> On Jun 15, 2024 at 3:20:19 PM EDT, "Farley Flud" <ff@linux.rocks> wrote:
>
>> On Sat, 15 Jun 2024 14:29:04 +0000, Farley Flud wrote:
>>
>>
>>> Write a C program to compute the subfactorial of an integer N.
>>>
>>>
>> Nobody got it (as predicted).
>
> Because no one bothered.

I actually took the opportunity to install the GMP documentation
on my system, look up what a "subfactorial" is, and do
an implementation that works for !N where N is 0 through 50.

Furled Fart lost the opportunity to show his prowess with
the GMP library by not demonstrating use of gmp_printf().

> This is all trivial stuff. These math "problems" have already been
> solved multiple times. That you think this is a "programming challenge"
> just shows how utterly clueless you are.

It's more of a "let's learn libgmp" challenge, which is a library
that he already has familiarity with. I don't think he learned anything.
And it's not that difficult a library to use.

> Hint: people were doing this 60 years ago on mainframes using Fortran.
> That you have only now discovered this proves AGAIN how utterly clueless
> you are.
>
>
> What's next? Compute Pi to a million decimal places? That also has
> already been done many times. Sounds like another great "programming
> challenge" for your feeble brain.

$ time ./try_mpz
0:1
1:0
2:1
3:2
4:9
5:44
[...]
49:223774392215649610092605161415154686480227084177314431854406736
50:11188719610782480504630258070757734324011354208865721592720336801

real 0m0.002s
user 0m0.001s
sys 0m0.001s

I also was interested in the recursive version. Here's the
run with N=50 with long long int's, which gives the wrong answer
due to overflow:

$ time ./try2
7531320031745615777

real 0m35.541s
user 0m35.530s
sys 0m0.001s

So: don't bother with the recursive version, except as
a pedantic exercize.

*Do* use GMP if you ever need to work with big numbers...
maybe numpy in Python can do the same thing, I wouldn't
know about that.

$ ll /usr/share/doc/gmp-doc/gmp.pdf.gz
-rw-r--r-- 1 root root 812615 Nov 16 2020 /usr/share/doc/gmp-doc/
gmp.pdf.gz

$ grep FLAGS Makefile
CFLAGS=-Wall -O3 -g -Wpedantic

--
-v System76 Thelio Mega v1.1 x86_64 NVIDIA RTX 3090 Ti
OS: Linux 6.9.4 Release: Mint 21.3 Mem: 258G
"Unrecoverable Error #666: Armegeddon in 30..29..28..27.."

> use of gmp_printf()

From the GMP manual:

|The flags accepted are as follows. GLIBC style ‘’’ is only for the
|standard C types (not the GMP types), and only if the C library supports
|it.

Lame.

--
-v System76 Thelio Mega v1.1 x86_64 NVIDIA RTX 3090 Ti
OS: Linux 6.9.4 Release: Mint 21.3 Mem: 258G
"MIPS: Meaningless Indicator of Processor Speed."

On 16 Jun 2024 08:19:11 GMT, vallor wrote:

>
> Furled Fart lost the opportunity to show his prowess with
> the GMP library by not demonstrating use of gmp_printf().
>

There's no reason to use that particular output function.

But you missed a definite error in the code that I deliberately
placed to catch any sharp eyes, but no catch.

>
> real 0m0.002s
> user 0m0.001s
> sys 0m0.001s
>

Whoa! That's slow!

On one of my "ancient" i7-4770 CPU machines:

time ./subfactorial 2500
[snip few hundred lines]
real 0m0.001s
user 0m0.001s
sys 0m0.000s

>
> I also was interested in the recursive version. Here's the
> run with N=50 with long long int's, which gives the wrong answer
> due to overflow:
>

Why long long? On an amd64 system, long long is actually the same
size as long, i.e. 64 bits.

But if you insist it should be UNSIGNED LONG LONG INT.

>
> maybe numpy in Python can do the same thing, I wouldn't
> know about that.
>

Numpy is just a front end to GMP.

Mathematica, Maple, Matlab, and all the other billion dollar
commercial math software use GMP.

How's that for mere "hobbyware?" Ha, ha, ha, ha, ha, ha!

>
> $ grep FLAGS Makefile
> CFLAGS=-Wall -O3 -g -Wpedantic
>

You should also have "-march=native -malign-data=cacheline" so
that the compiler can optimize cache access.

On 6/15/2024 3:57 PM, Despicable Diego wrote:

> Question: Why is Rust so popular?
>
> Answer: Because it saves all the incompetent idiots who cannot adequately
> wield C.

Such as you.

On Sun, 16 Jun 2024 04:24:51 +0000, Tyrone wrote:

> What's next? Compute Pi to a million decimal places? That also has
> already been done many times. Sounds like another great "programming
> challenge" for your feeble brain.

https://arstechnica.com/gaming/2024/06/retired-engineer-discovers-55-year-
old-bug-in-lunar-lander-computer-game-code/

Maybe a clean room version of Lunar Lander without the bug?

On 6/16/2024 4:19 AM, vallor wrote:
>> On Jun 15, 2024 at 3:20:19 PM EDT, "Farley Flud" <ff@linux.rocks> wrote:
>>
>>> On Sat, 15 Jun 2024 14:29:04 +0000, Farley Flud wrote:
>>>
>>>
>>>> Write a C program to compute the subfactorial of an integer N.
>>>>
>>>>
>>> Nobody got it (as predicted).
>>
>> Because no one bothered.
>
> I actually took the opportunity to install the GMP documentation
> on my system, look up what a "subfactorial" is, and do
> an implementation that works for !N where N is 0 through 50.

Where's your code?

Here's an approximation of !n, using round(n!/e)
-----------------------------------------
#include <stdio.h>
#include <stdlib.h>
int main(int argc, char *argv[]){
int n = atoi(argv[1]);
for(int i=1;i<=n;i++){
double f=1.0;
for(int n=1;n<=i;n++){
f*=n;
}
f/=2.71828;
printf("%d. %.0f\n",i,(f));
}
}
-----------------------------------------
$ ./prog n

Without using a bignum library, it craps out at 171 and prints 'inf' (so
does python)

1. 0
2. 1
3. 2
4. 9
5. 44
6. 265
7. 1854
8. 14833
9. 133496
10. 1334962
11. 14684580
12. 176214959
13. 2290794473
14. 32071122622
15. 481066839325
16. 7697069429198
17. 130850180296364
18. 2355303245334550
19. 44750761661356448
20. 895015233227128960
21. 18795319897769705472
22. 413497037750933585920
23. 9510431868271472934912
24. 228250364838515316883456
25. 5706259120962883593175040
....
50. 11188727136907667116392988817975029667335257249097046505283387392
....
170.
2669855796793558290010001570575275101705027811519977073818130755407973315261224007251979700779512228624245141462623296456740188588977348681648565542706396927622340485993465997718765185927438606647566078414539613618036013433690401156103581768582773608415498699128984156662958003889715092930354450116728848384
171. inf

> Furled Fart lost the opportunity to show his prowess with
> the GMP library by not demonstrating use of gmp_printf().

Note he also lied "we ignore N = 1, 2 as they are trivial"

He ignored them because he didn't know how to handle those cases.
That's the kind of devious, evasive wanker he is.

Notice he said "you missed a definite error in the code that I
deliberately placed to catch any sharp eyes, but no catch."

This is another devious lie he uses to try and excuse mistakes in his
"perfect code".

>> This is all trivial stuff. These math "problems" have already been
>> solved multiple times. That you think this is a "programming challenge"
>> just shows how utterly clueless you are.
>
> It's more of a "let's learn libgmp" challenge, which is a library
> that he already has familiarity with. I don't think he learned anything.
> And it's not that difficult a library to use.
>
>> Hint: people were doing this 60 years ago on mainframes using Fortran.
>> That you have only now discovered this proves AGAIN how utterly clueless
>> you are.
>>
>>
>> What's next? Compute Pi to a million decimal places? That also has
>> already been done many times. Sounds like another great "programming
>> challenge" for your feeble brain.
>
> $ time ./try_mpz
> 0:1
> 1:0
> 2:1
> 3:2
> 4:9
> 5:44
> [...]
> 49:223774392215649610092605161415154686480227084177314431854406736
> 50:11188719610782480504630258070757734324011354208865721592720336801
>
> real 0m0.002s
> user 0m0.001s
> sys 0m0.001s
>
> I also was interested in the recursive version. Here's the
> run with N=50 with long long int's, which gives the wrong answer
> due to overflow:
>
> $ time ./try2
> 7531320031745615777
>
> real 0m35.541s
> user 0m35.530s
> sys 0m0.001s
>
> So: don't bother with the recursive version, except as
> a pedantic exercize.
>
> *Do* use GMP if you ever need to work with big numbers...
> maybe numpy in Python can do the same thing, I wouldn't
> know about that.
>
> $ ll /usr/share/doc/gmp-doc/gmp.pdf.gz
> -rw-r--r-- 1 root root 812615 Nov 16 2020 /usr/share/doc/gmp-doc/
> gmp.pdf.gz
>
> $ grep FLAGS Makefile
> CFLAGS=-Wall -O3 -g -Wpedantic
>

On Jun 16, 2024 at 1:25:50 PM EDT, "rbowman" <bowman@montana.com> wrote:

> On Sun, 16 Jun 2024 04:24:51 +0000, Tyrone wrote:
>
>> What's next? Compute Pi to a million decimal places? That also has
>> already been done many times. Sounds like another great "programming
>> challenge" for your feeble brain.
>
> https://arstechnica.com/gaming/2024/06/retired-engineer-discovers-55-year-
> old-bug-in-lunar-lander-computer-game-code/

I remember playing that game. It was very difficult to have a successful
landing. We were playing on an NCR 605(IIRC) mini computer that was the size
of a washing machine. No screen, just paper printout. This was around 1980 or
so.

> Maybe a clean room version of Lunar Lander without the bug?

A clean room version of "Hello World" would be beyond his capabilities,
because no math is involved.

> On 6/16/2024 4:19 AM, vallor wrote:
>>> On Jun 15, 2024 at 3:20:19 PM EDT, "Farley Flud" <ff@linux.rocks>
>>> wrote:
>>>
>>>> On Sat, 15 Jun 2024 14:29:04 +0000, Farley Flud wrote:
>>>>
>>>>
>>>>> Write a C program to compute the subfactorial of an integer N.
>>>>>
>>>>>
>>>> Nobody got it (as predicted).
>>>
>>> Because no one bothered.
>>
>> I actually took the opportunity to install the GMP documentation on my
>> system, look up what a "subfactorial" is, and do an implementation that
>> works for !N where N is 0 through 50.
>
> Where's your code?

https://github.com/vallor/subfactorial/

$ ./try_mpz
0:1
1:0
2:1
3:2
4:9
5:44
6:265
7:1,854
[...]
48:4,566,824,330,931,624,695,767,452,273,778,667,071,025,042,534,230,906,772,538,913
49:223,774,392,215,649,610,092,605,161,415,154,686,480,227,084,177,314,431,854,406,736
50:11,188,719,610,782,480,504,630,258,070,757,734,324,011,354,208,865,721,592,720,336,801

(I wrote a function to format the numbers.)

--
-v System76 Thelio Mega v1.1 x86_64 NVIDIA RTX 3090 Ti
OS: Linux 6.9.4 Release: Mint 21.3 Mem: 258G
"I don't eat snails... I prefer FAST food!"

vallor wrote:
>> On 6/16/2024 4:19 AM, vallor wrote:
>>>> On Jun 15, 2024 at 3:20:19 PM EDT, "Farley Flud" <ff@linux.rocks>
>>>> wrote:
>>>>
>>>>> On Sat, 15 Jun 2024 14:29:04 +0000, Farley Flud wrote:
>>>>>
>>>>>
>>>>>> Write a C program to compute the subfactorial of an integer N.
>>>>>>
>>>>>>
>>>>> Nobody got it (as predicted).
>>>>
>>>> Because no one bothered.
>>>
>>> I actually took the opportunity to install the GMP documentation on my
>>> system, look up what a "subfactorial" is, and do an implementation that
>>> works for !N where N is 0 through 50.
>>
>> Where's your code?
>
> https://github.com/vallor/subfactorial/
>
> $ ./try_mpz
> 0:1
> 1:0
> 2:1
> 3:2
> 4:9
> 5:44
> 6:265
> 7:1,854
> [...]
> 48:4,566,824,330,931,624,695,767,452,273,778,667,071,025,042,534,230,906,772,538,913
> 49:223,774,392,215,649,610,092,605,161,415,154,686,480,227,084,177,314,431,854,406,736
> 50:11,188,719,610,782,480,504,630,258,070,757,734,324,011,354,208,865,721,592,720,336,801
>
> (I wrote a function to format the numbers.)
>
this is not advocacy , you're off topic

> vallor wrote:
>>> On 6/16/2024 4:19 AM, vallor wrote:
>>>>> On Jun 15, 2024 at 3:20:19 PM EDT, "Farley Flud" <ff@linux.rocks>
>>>>> wrote:
>>>>>
>>>>>> On Sat, 15 Jun 2024 14:29:04 +0000, Farley Flud wrote:
>>>>>>
>>>>>>
>>>>>>> Write a C program to compute the subfactorial of an integer N.
>>>>>>>
>>>>>>>
>>>>>> Nobody got it (as predicted).
>>>>>
>>>>> Because no one bothered.
>>>>
>>>> I actually took the opportunity to install the GMP documentation on my
>>>> system, look up what a "subfactorial" is, and do an implementation that
>>>> works for !N where N is 0 through 50.
>>>
>>> Where's your code?
>>
>> https://github.com/vallor/subfactorial/
>>
>> $ ./try_mpz
>> 0:1
>> 1:0
>> 2:1
>> 3:2
>> 4:9
>> 5:44
>> 6:265
>> 7:1,854
>> [...]
>> 48:4,566,824,330,931,624,695,767,452,273,778,667,071,025,042,534,230,906,772,538,913
>> 49:223,774,392,215,649,610,092,605,161,415,154,686,480,227,084,177,314,431,854,406,736
>> 50:11,188,719,610,782,480,504,630,258,070,757,734,324,011,354,208,865,721,592,720,336,801
>>
>> (I wrote a function to format the numbers.)
>>
> this is not advocacy , you're off topic

Au contraire, Monseur -- showing off the capabilities of
the GNU Multi-precision library highlights the easy of
numeric computation on LINUX.

And my quick-and-dirty formatter fills in a deficiency
in gmp_printf() -- it doesn't grok "'" for a format
specifier for mpz entities.

Show your mom! 🖖️👽️

--
-v System76 Thelio Mega v1.1 x86_64 NVIDIA RTX 3090 Ti
OS: Linux 6.9.4 Release: Mint 21.3 Mem: 258G

On Sun, 16 Jun 2024 18:24:08 -0700, % <pursent100@gmail.com> wrote in
<FoGdnfEtJYWlDfL7nZ2dnZfqn_gAAAAA@giganews.com>:
> this is not advocacy , you're off topic

Fine.

FRESH! LINUX!

$ uname -a
Linux lm 6.9.5 #1 SMP PREEMPT_DYNAMIC Sun Jun 16 20:09:50 PDT 2024 x86_64
x86_64 x86_64 GNU/Linux

Compile time with -j48 and sources on my NAS:

real 2371.85
user 16336.41
sys 4707.19

--
-v System76 Thelio Mega v1.1 x86_64 NVIDIA RTX 3090 Ti
OS: Linux 6.9.5 Release: Mint 21.3 Mem: 258G
"Talk is cheap because Supply exceeds Demand."

vallor wrote:
>> vallor wrote:
>>>> On 6/16/2024 4:19 AM, vallor wrote:
>>>>>> On Jun 15, 2024 at 3:20:19 PM EDT, "Farley Flud" <ff@linux.rocks>
>>>>>> wrote:
>>>>>>
>>>>>>> On Sat, 15 Jun 2024 14:29:04 +0000, Farley Flud wrote:
>>>>>>>
>>>>>>>
>>>>>>>> Write a C program to compute the subfactorial of an integer N.
>>>>>>>>
>>>>>>>>
>>>>>>> Nobody got it (as predicted).
>>>>>>
>>>>>> Because no one bothered.
>>>>>
>>>>> I actually took the opportunity to install the GMP documentation on my
>>>>> system, look up what a "subfactorial" is, and do an implementation that
>>>>> works for !N where N is 0 through 50.
>>>>
>>>> Where's your code?
>>>
>>> https://github.com/vallor/subfactorial/
>>>
>>> $ ./try_mpz
>>> 0:1
>>> 1:0
>>> 2:1
>>> 3:2
>>> 4:9
>>> 5:44
>>> 6:265
>>> 7:1,854
>>> [...]
>>> 48:4,566,824,330,931,624,695,767,452,273,778,667,071,025,042,534,230,906,772,538,913
>>> 49:223,774,392,215,649,610,092,605,161,415,154,686,480,227,084,177,314,431,854,406,736
>>> 50:11,188,719,610,782,480,504,630,258,070,757,734,324,011,354,208,865,721,592,720,336,801
>>>
>>> (I wrote a function to format the numbers.)
>>>
>> this is not advocacy , you're off topic
>
> Au contraire, Monseur -- showing off the capabilities of
> the GNU Multi-precision library highlights the easy of
> numeric computation on LINUX.
>
> And my quick-and-dirty formatter fills in a deficiency
> in gmp_printf() -- it doesn't grok "'" for a format
> specifier for mpz entities.
>
> Show your mom! 🖖️👽️
>
dragging peoples family into usenet is not advocacy you're off topic

On 6/16/2024 8:04 PM, vallor wrote:

> 50:11,188,719,610,782,480,504,630,258,070,757,734,324,011,354,208,865,721,592,720,336,801
>
> (I wrote a function to format the numbers.)

in C?

Here's a generalized python function I just wrote that puts whatever
character at whatever spacing, working from the end.

------------------------------------------------------------------------
def strfmt(val,char,space):
if space >= len(str(val)):
print("Spacing of %d is too large for '%s'" % (space,str(val)))
return
if len(str(val)) > space:
begin = len(str(val)) - space
end = begin + space
sval = '' #output string
while begin > 0:
sval = str(char) + str(val)[begin:end] + sval
begin -= space
end -= space
sval = str(val)[0:end] + sval #remainder
print(sval)
else:
print(str(val))
------------------------------------------------------------------------

strfmt(11188719610782480504630258070757734324011354208865721592720336801,',',3)
11,188,719,610,782,480,504,630,258,070,757,734,324,011,354,208,865,721,592,720,336,801
strfmt(1234,',',3)
1,234

strfmt(12345,',',3)
12,345

strfmt(123456,',',3)
123,456

strfmt(1234567,'-',2)
1-23-45-67

strfmt(12345678,'.',1)
1.2.3.4.5.6.7.8

strfmt(123456789,' ',3)
123 456 789

strfmt(1234567890,',',3)
1,234,567,890

strfmt('abc','-',4)
Spacing of 4 is too large for 'abc'

strfmt('abcdef','_',1)
a_b_c_d_e_f

strfmt(11188719610782480504630258070757734324011354208865721592720336801,'
',4)
1 1188 7196 1078 2480 5046 3025 8070 7577 3432 4011 3542 0886 5721 5927
2033 6801

On Mon, 17 Jun 2024 14:30:47 -0400, DFS <nospam@dfs.com> wrote in
<667080d6$0$3747318$882e4bbb@reader.netnews.com>:

> On 6/16/2024 8:04 PM, vallor wrote:
>
>>
50:11,188,719,610,782,480,504,630,258,070,757,734,324,011,354,208,865,721,592,720,336,801
>>
>> (I wrote a function to format the numbers.)
>
> in C?

Yes, and it is in the git repo that I posted:

https://github.com/vallor/subfactorial/blob/main/format_longnum.c

There's one thing I'd change about it (adding a "break" to
elide redundant code), but ICBB.

It's also not appropriate for long-running programs as it stands,
since it will leak memory. So if I were do something serious with
it, I'd strcpy() the resulting string to a new malloc'ed chunk of memory,
free the working memory, then return the new chunk (to be free()'ed by
the caller).

--
-v System76 Thelio Mega v1.1 x86_64 NVIDIA RTX 3090 Ti
OS: Linux 6.9.5 Release: Mint 21.3 Mem: 258G

On 17 Jun 2024 03:38:35 GMT, vallor wrote:

>
> Compile time with -j48 and sources on my NAS:
>
> real 2371.85
> user 16336.41
> sys 4707.19
>

What the flamin' fuck!

Do you actually mean that it requires 40+ minutes for you
to compile a kernel?

I have been compiling kernels for years and it's always been
about 2 minutes, at -j8, which includes all the modules.

It must be the kernel configuration. I configure the kernel
to include only the stuff I need and I especially exclude all
that security bullshit.

What is the size of your compressed kernel image? This is
the file named "bzImage" in the kernel source tree.

My bzImage, for kernel 6.9.1, is only 3154944 bytes.

Note that the "bz" does not necessarily indicate that bzip2
compression is used. The particular compression algorithm
is set at kernel configuration. Mine uses LZMA.