Re: Tough FACTORIAL math problem...

Article View: comp.lang.pascal.misc

Article #44

Back to comp.lang.pascal.misc Previous Next

#44

From: Harlan Messinger
Date: Fri, 16 Feb 1996 16:14

14 lines
1038 bytes

void getLastFactorialDigits(int results[], // assume sufficient space
                                           // was preallocated (n+1 bytes)
				int n) {

	results[0] = 1;
	results[1] = 1;
	for (int i = 2; i <= n; ++i) {
		results[i] = results[i - 1] * i;
		while (results[i] % 10 == 0)
			results[i] /= 10;
		results[i] = results[i] % 10;
	}
	return;
}

Technical Details

Message-ID: <4g2agv$29r@clarknet.clark.net>

Path: arc1-ca.pugleaf.net!news.clark.net!not-for-mail

References: <4fr8be$ass@news.iconn.net>

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!news.clark.net!not-for-mail
From: gusty@clark.net (Harlan Messinger)
Newsgroups: comp.lang.pascal.misc,comp.lang.c++,comp.lang.c,comp.lang.pascal.borland
Subject: Re: Tough FACTORIAL math problem...
Followup-To: comp.lang.pascal.misc,comp.lang.c++,comp.lang.c,comp.lang.pascal.borland
Date: 16 Feb 1996 16:14:23 GMT
Organization: Clark Internet Services, Inc., Ellicott City, MD USA
Message-ID: <4g2agv$29r@clarknet.clark.net>
References: <4fr8be$ass@news.iconn.net>
NNTP-Posting-Host: explorer.clark.net
Mime-Version: 1.0
Content-Type: TEXT/PLAIN; charset=ISO-8859-1
Content-Transfer-Encoding: 8bit
X-Newsreader: TIN [UNIX 1.3 950726BETA PL0]

Reply to Parent Message