Path: utzoo!attcan!uunet!crdgw1!uakari.primate.wisc.edu!zaphod.mps.ohio-state.edu!swrinde!emory!stiatl!srchtec!johnb
From: johnb@srchtec.UUCP (John Baldwin)
Newsgroups: comp.lang.c
Subject: Re: Leap Year Checker.
Message-ID: <242@srchtec.UUCP>
Date: 27 Sep 90 22:59:47 GMT
References: <9464@uhccux.uhcc.Hawaii.Edu> <24700010@sunc1> <1115.26ff47b6@iccgcc.decnet.ab.com>
Organization: search technology, inc.
Lines: 23


 (Stan Brown, Oak Road Systems) writes:

|In article <24700010@sunc1>, mccaugh@sunc1.cs.uiuc.edu writes:
|> Ordinarily, a leap-year is a multiple of four, so that--given leap-year y--
|> (y%4 == 0) ought to indicate if y designates a leap-year.

|Bzzzzzt!  Nope, but thanks for playing.  Vanna has lovely gifts for you.

|Every leap year is divisible by four, but not every year divisible by
|four is a leap year.  Since the 18th century (I think 1752, but an
|earlier century in R.C. countries), the algorithm has been...

BRRRAPPP.  Sorry, your time's up.
           What do we have for the programmers, Johnny?


The date was 1582.

-- 
John T. Baldwin                     | "Pereant qui ante nos nostra dixerunt!"
Search Technology, Inc.             | (A plague on those who said our good
johnb%srchtec.uucp@mathcs.emory.edu |  things before we did!)