Path: newsspool2.news.pas.earthlink.net!stamper.news.pas.earthlink.net!elnk-nf2-pas!newsfeed.earthlink.net!wn14feed!wn13feed!worldnet.att.net!204.127.198.203!attbi_feed3!attbi.com!sccrnsc02.POSTED!not-for-mail
Message-ID: <cpF3b.292265$o%2.135807@sccrnsc02>
From: "Minor Crank" <blue_whaleANTISPAM@comcast.net>
Newsgroups: sci.physics,sci.math
Subject: Re: Memory requirement, prime counting clincher
Date: Fri, 29 Aug 2003 09:54:16 GMT
References: <3c65f87.0308280751.338c5909@posting.google.com> <bo1tkvsp6b7p425dggebnpp70velrkop6q@4ax.com>
Lines: 173
X-Priority: 3
X-MSMail-Priority: Normal
X-Newsreader: Microsoft Outlook Express 6.00.2800.1158
X-MimeOLE: Produced By Microsoft MimeOLE V6.00.2800.1165
NNTP-Posting-Host: 12.237.91.10
X-Complaints-To: abuse@comcast.net
X-Trace: sccrnsc02 1062150856 12.237.91.10 (Fri, 29 Aug 2003 09:54:16 GMT)
NNTP-Posting-Date: Fri, 29 Aug 2003 09:54:16 GMT
Organization: Comcast Online
X-Received-Date: Fri, 29 Aug 2003 02:54:17 PDT (newsspool2.news.pas.earthlink.net)
Xref: lexi2.athghost7038suus.net sci.physics:75345 sci.math:34441

"Randy Poe" <rpoePA@yahoo.com> wrote in message
news:bo1tkvsp6b7p425dggebnpp70velrkop6q@4ax.com...

> You also, with only a little bit of work, could have an excellent shot
> at winning the Obscure C coding competition.

I dunno. Here is a "best in show" Obfuscated C prime number generator from a
few years ago. All the calculations are done in the preprocessor. Be careful
running it. It's even slower than James' version.
http://www.cise.ufl.edu/~manuel/obfuscate/zsmall.hint

#ifdef a
#undef a
#ifdef b
#undef b
#ifdef c
#undef c
#ifdef e
#undef e
#ifdef f
#undef f
#ifdef g
#undef g
#ifdef h
#undef h
#ifdef i
#undef i
#ifdef j
#undef j
#ifdef k
#undef k
#else
#define k
#endif
#else
#define j
#endif
#else
#define i
#endif
#else
#define h
#endif
#else
#define g
#endif
#else
#define f
#endif
#else
#define e
#endif
#else
#define c
#endif
#else
#define b
#endif
#else
#define a
#endif
#ifdef k
#define p (1<<7)
#else
#define p 0
#endif
#ifdef j
#define q (1<<6)
#else
#define q 0
#endif
#ifdef i
#define r (1<<5)
#else
#define r 0
#endif
#ifdef h
#define s (1<<4)
#else
#define s 0
#endif
#ifdef g
#define t (1<<3)
#else
#define t 0
#endif
#ifdef f
#define u (1<<2)
#else
#define u 0
#endif
#ifdef e
#define v (1<<1)
#else
#define v 0
#endif
#define vv (p+q+r+s+t+u+v+1)
#define ff \
 (defined(c)*8+defined(b)*4+defined(a)*2+1)
#if vv==1
#undef vv
#define vv 2
#endif
#if ff<vv
#if ff!=1
#if (vv/ff)*ff==vv
#ifndef dd
#define dd
#endif
#endif
#endif
#endif
#if ff==15
#ifdef dd
#undef dd
#else
printf("%d\n", vv);
#endif
#endif
#undef ff
#undef vv
#undef p
#undef q
#undef r
#undef s
#undef t
#undef u
#undef v
#ifdef w
#ifdef x
#ifdef y
#ifndef z
#define z
#endif
#else
#define y
#endif
#else
#define x
#endif
#else
#define w
#include <stdio.h>
main(){
#endif
#ifndef z
#include "zsmall.c"
#include "zsmall.c"
#include "zsmall.c"
#include "zsmall.c"
#include "zsmall.c"
#include "zsmall.c"
#include "zsmall.c"
#include "zsmall.c"
#endif
#ifdef z
#undef z
#else
#ifdef y
#undef y
#else
#ifdef x
#undef x
#else
#ifdef w
#undef w
}
#endif
#endif
#endif
#endif